8,012,000

2⁵ × 5³ × 2003

8,012,000 factors as 2^5 × 5^3 × 2003. Its 48 positive divisors give a proper-divisor sum of 11,683,312, so this integer is abundant. The Collatz stopping time is 142 steps.

Prime Factor Structure

Factorization String 2^5 × 5^3 × 2003

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 19,695,312

Proper Divisor Sum 11,683,312

Digit Sum / Digital Root 11 (Root: 2)

Adjacent Primes #8011999 ← → #8012003

Radix Representation

Decimal	8012000
Binary	11110100100000011100000 (23 bits)
Octal	0o36440340
Hexadecimal	0x7A40E0

Divisor Catalog (48)

1 2 4 5 8 10 16 20 25 32 40 50 80 100 125 160 200 250 400 500 800 1,000 2,000 2,003 4,000 4,006 8,012 10,015 16,024 20,030 32,048 40,060 50,075 64,096 80,120 100,150 160,240 200,300 250,375 320,480 400,600 500,750 801,200 1,001,500 1,602,400 2,003,000 4,006,000 8,012,000

Collatz Trajectory (142 steps to reach 1)

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

8,012,000 4,006,000 2,003,000 1,001,500 500,750 250,375 751,126 375,563 1,126,690 563,345 1,690,036 845,018 422,509 1,267,528 633,764 316,882 158,441 475,324 237,662 118,831 356,494 178,247 534,742 267,371 802,114 401,057 1,203,172 601,586 300,793 902,380 451,190 225,595 676,786 338,393 1,015,180 507,590 253,795 761,386 380,693 1,142,080 571,040 285,520 142,760 71,380 35,690 17,845 53,536 26,768 13,384 6,692 3,346 1,673 5,020 2,510 1,255 3,766 1,883 5,650 2,825 8,476

← Previous Integer #8,011,999 Browse Full Index Next Integer #8,012,001 →