9,662,664

2³ × 3 × 11 × 17 × 2153

9,662,664 factors as 2^3 × 3 × 11 × 17 × 2153. Its 64 positive divisors give a proper-divisor sum of 18,253,176, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 11 × 17 × 2153

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 27,915,840

Proper Divisor Sum 18,253,176

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9662663 ← → #9662671

Radix Representation

Decimal	9662664
Binary	100100110111000011001000 (24 bits)
Octal	0o44670310
Hexadecimal	0x9370C8

Divisor Catalog (60 of 64)

1 2 3 4 6 8 11 12 17 22 24 33 34 44 51 66 68 88 102 132 136 187 204 264 374 408 561 748 1,122 1,496 2,153 2,244 4,306 4,488 6,459 8,612 12,918 17,224 23,683 25,836 36,601 47,366 51,672 71,049 73,202 94,732 109,803 142,098 146,404 189,464 219,606 284,196 292,808 402,611 439,212 568,392 805,222 878,424 1,207,833 1,610,444

Collatz Trajectory (163 steps to reach 1)

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

9,662,664 4,831,332 2,415,666 1,207,833 3,623,500 1,811,750 905,875 2,717,626 1,358,813 4,076,440 2,038,220 1,019,110 509,555 1,528,666 764,333 2,293,000 1,146,500 573,250 286,625 859,876 429,938 214,969 644,908 322,454 161,227 483,682 241,841 725,524 362,762 181,381 544,144 272,072 136,036 68,018 34,009 102,028 51,014 25,507 76,522 38,261 114,784 57,392 28,696 14,348 7,174 3,587 10,762 5,381 16,144 8,072 4,036 2,018 1,009 3,028 1,514 757 2,272 1,136 568 284

← Previous Integer #9,662,663 Browse Full Index Next Integer #9,662,665 →