4,912,008

2³ × 3 × 204667

4,912,008 factors as 2^3 × 3 × 204667. Its 16 positive divisors give a proper-divisor sum of 7,368,072, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 204667

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 12,280,080

Proper Divisor Sum 7,368,072

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4912007 ← → #4912027

Radix Representation

Decimal	4912008
Binary	10010101111001110001000 (23 bits)
Octal	0o22571610
Hexadecimal	0x4AF388

Divisor Catalog (16)

1 2 3 4 6 8 12 24 204,667 409,334 614,001 818,668 1,228,002 1,637,336 2,456,004 4,912,008

Collatz Trajectory (131 steps to reach 1)

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

4,912,008 2,456,004 1,228,002 614,001 1,842,004 921,002 460,501 1,381,504 690,752 345,376 172,688 86,344 43,172 21,586 10,793 32,380 16,190 8,095 24,286 12,143 36,430 18,215 54,646 27,323 81,970 40,985 122,956 61,478 30,739 92,218 46,109 138,328 69,164 34,582 17,291 51,874 25,937 77,812 38,906 19,453 58,360 29,180 14,590 7,295 21,886 10,943 32,830 16,415 49,246 24,623 73,870 36,935 110,806 55,403 166,210 83,105 249,316 124,658 62,329 186,988

← Previous Integer #4,912,007 Browse Full Index Next Integer #4,912,009 →