8,814,840

2³ × 3 × 5 × 17 × 29 × 149

8,814,840 factors as 2^3 × 3 × 5 × 17 × 29 × 149. Its 128 positive divisors give a proper-divisor sum of 20,345,160, so this integer is abundant. The Collatz stopping time is 181 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5 × 17 × 29 × 149

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 128

Divisor Sum (σ) 29,160,000

Proper Divisor Sum 20,345,160

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #8814833 ← → #8814851

Radix Representation

Decimal	8814840
Binary	100001101000000011111000 (24 bits)
Octal	0o41500370
Hexadecimal	0x8680F8

Divisor Catalog (60 of 128)

1 2 3 4 5 6 8 10 12 15 17 20 24 29 30 34 40 51 58 60 68 85 87 102 116 120 136 145 149 170 174 204 232 255 290 298 340 348 408 435 447 493 510 580 596 680 696 745 870 894 986 1,020 1,160 1,192 1,479 1,490 1,740 1,788 1,972 2,040

Collatz Trajectory (181 steps to reach 1)

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

8,814,840 4,407,420 2,203,710 1,101,855 3,305,566 1,652,783 4,958,350 2,479,175 7,437,526 3,718,763 11,156,290 5,578,145 16,734,436 8,367,218 4,183,609 12,550,828 6,275,414 3,137,707 9,413,122 4,706,561 14,119,684 7,059,842 3,529,921 10,589,764 5,294,882 2,647,441 7,942,324 3,971,162 1,985,581 5,956,744 2,978,372 1,489,186 744,593 2,233,780 1,116,890 558,445 1,675,336 837,668 418,834 209,417 628,252 314,126 157,063 471,190 235,595 706,786 353,393 1,060,180 530,090 265,045 795,136 397,568 198,784 99,392 49,696 24,848 12,424 6,212 3,106 1,553

← Previous Integer #8,814,839 Browse Full Index Next Integer #8,814,841 →