9,409,224

2³ × 3 × 11 × 29 × 1229

9,409,224 factors as 2^3 × 3 × 11 × 29 × 1229. Its 64 positive divisors give a proper-divisor sum of 17,158,776, so this integer is abundant. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 11 × 29 × 1229

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 26,568,000

Proper Divisor Sum 17,158,776

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9409219 ← → #9409229

Radix Representation

Decimal	9409224
Binary	100011111001001011001000 (24 bits)
Octal	0o43711310
Hexadecimal	0x8F92C8

Divisor Catalog (60 of 64)

1 2 3 4 6 8 11 12 22 24 29 33 44 58 66 87 88 116 132 174 232 264 319 348 638 696 957 1,229 1,276 1,914 2,458 2,552 3,687 3,828 4,916 7,374 7,656 9,832 13,519 14,748 27,038 29,496 35,641 40,557 54,076 71,282 81,114 106,923 108,152 142,564 162,228 213,846 285,128 324,456 392,051 427,692 784,102 855,384 1,176,153 1,568,204

Collatz Trajectory (176 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

9,409,224 4,704,612 2,352,306 1,176,153 3,528,460 1,764,230 882,115 2,646,346 1,323,173 3,969,520 1,984,760 992,380 496,190 248,095 744,286 372,143 1,116,430 558,215 1,674,646 837,323 2,511,970 1,255,985 3,767,956 1,883,978 941,989 2,825,968 1,412,984 706,492 353,246 176,623 529,870 264,935 794,806 397,403 1,192,210 596,105 1,788,316 894,158 447,079 1,341,238 670,619 2,011,858 1,005,929 3,017,788 1,508,894 754,447 2,263,342 1,131,671 3,395,014 1,697,507 5,092,522 2,546,261 7,638,784 3,819,392 1,909,696 954,848 477,424 238,712 119,356 59,678

← Previous Integer #9,409,223 Browse Full Index Next Integer #9,409,225 →