8,004,708

2² × 3² × 43 × 5171

8,004,708 factors as 2^2 × 3^2 × 43 × 5171. Its 36 positive divisors give a proper-divisor sum of 12,703,980, so this integer is abundant. The Collatz stopping time is 168 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 43 × 5171

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 20,708,688

Proper Divisor Sum 12,703,980

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #8004697 ← → #8004709

Radix Representation

Decimal	8004708
Binary	11110100010010001100100 (23 bits)
Octal	0o36422144
Hexadecimal	0x7A2464

Divisor Catalog (36)

1 2 3 4 6 9 12 18 36 43 86 129 172 258 387 516 774 1,548 5,171 10,342 15,513 20,684 31,026 46,539 62,052 93,078 186,156 222,353 444,706 667,059 889,412 1,334,118 2,001,177 2,668,236 4,002,354 8,004,708

Collatz Trajectory (168 steps to reach 1)

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

8,004,708 4,002,354 2,001,177 6,003,532 3,001,766 1,500,883 4,502,650 2,251,325 6,753,976 3,376,988 1,688,494 844,247 2,532,742 1,266,371 3,799,114 1,899,557 5,698,672 2,849,336 1,424,668 712,334 356,167 1,068,502 534,251 1,602,754 801,377 2,404,132 1,202,066 601,033 1,803,100 901,550 450,775 1,352,326 676,163 2,028,490 1,014,245 3,042,736 1,521,368 760,684 380,342 190,171 570,514 285,257 855,772 427,886 213,943 641,830 320,915 962,746 481,373 1,444,120 722,060 361,030 180,515 541,546 270,773 812,320 406,160 203,080 101,540 50,770

← Previous Integer #8,004,707 Browse Full Index Next Integer #8,004,709 →