8,701,968

2⁴ × 3 × 11 × 16481

8,701,968 factors as 2^4 × 3 × 11 × 16481. Its 40 positive divisors give a proper-divisor sum of 15,823,248, so this integer is abundant. The Collatz stopping time is 124 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 11 × 16481

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 24,525,216

Proper Divisor Sum 15,823,248

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #8701961 ← → #8701991

Radix Representation

Decimal	8701968
Binary	100001001100100000010000 (24 bits)
Octal	0o41144020
Hexadecimal	0x84C810

Divisor Catalog (40)

1 2 3 4 6 8 11 12 16 22 24 33 44 48 66 88 132 176 264 528 16,481 32,962 49,443 65,924 98,886 131,848 181,291 197,772 263,696 362,582 395,544 543,873 725,164 791,088 1,087,746 1,450,328 2,175,492 2,900,656 4,350,984 8,701,968

Collatz Trajectory (124 steps to reach 1)

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

8,701,968 4,350,984 2,175,492 1,087,746 543,873 1,631,620 815,810 407,905 1,223,716 611,858 305,929 917,788 458,894 229,447 688,342 344,171 1,032,514 516,257 1,548,772 774,386 387,193 1,161,580 580,790 290,395 871,186 435,593 1,306,780 653,390 326,695 980,086 490,043 1,470,130 735,065 2,205,196 1,102,598 551,299 1,653,898 826,949 2,480,848 1,240,424 620,212 310,106 155,053 465,160 232,580 116,290 58,145 174,436 87,218 43,609 130,828 65,414 32,707 98,122 49,061 147,184 73,592 36,796 18,398 9,199

← Previous Integer #8,701,967 Browse Full Index Next Integer #8,701,969 →