9,918,696

2³ × 3 × 29 × 14251

9,918,696 factors as 2^3 × 3 × 29 × 14251. Its 32 positive divisors give a proper-divisor sum of 15,734,904, so this integer is abundant. The Collatz stopping time is 207 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 29 × 14251

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 25,653,600

Proper Divisor Sum 15,734,904

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #9918683 ← → #9918697

Radix Representation

Decimal	9918696
Binary	100101110101100011101000 (24 bits)
Octal	0o45654350
Hexadecimal	0x9758E8

Divisor Catalog (32)

1 2 3 4 6 8 12 24 29 58 87 116 174 232 348 696 14,251 28,502 42,753 57,004 85,506 114,008 171,012 342,024 413,279 826,558 1,239,837 1,653,116 2,479,674 3,306,232 4,959,348 9,918,696

Collatz Trajectory (207 steps to reach 1)

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

9,918,696 4,959,348 2,479,674 1,239,837 3,719,512 1,859,756 929,878 464,939 1,394,818 697,409 2,092,228 1,046,114 523,057 1,569,172 784,586 392,293 1,176,880 588,440 294,220 147,110 73,555 220,666 110,333 331,000 165,500 82,750 41,375 124,126 62,063 186,190 93,095 279,286 139,643 418,930 209,465 628,396 314,198 157,099 471,298 235,649 706,948 353,474 176,737 530,212 265,106 132,553 397,660 198,830 99,415 298,246 149,123 447,370 223,685 671,056 335,528 167,764 83,882 41,941 125,824 62,912

← Previous Integer #9,918,695 Browse Full Index Next Integer #9,918,697 →