7,604,000

2⁵ × 5³ × 1901

7,604,000 factors as 2^5 × 5^3 × 1901. Its 48 positive divisors give a proper-divisor sum of 11,088,856, so this integer is abundant. The Collatz stopping time is 129 steps.

Prime Factor Structure

Factorization String 2^5 × 5^3 × 1901

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 18,692,856

Proper Divisor Sum 11,088,856

Digit Sum / Digital Root 17 (Root: 8)

Adjacent Primes #7603997 ← → #7604017

Radix Representation

Decimal	7604000
Binary	11101000000011100100000 (23 bits)
Octal	0o35003440
Hexadecimal	0x740720

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 1,901 2,000 3,802 4,000 7,604 9,505 15,208 19,010 30,416 38,020 47,525 60,832 76,040 95,050 152,080 190,100 237,625 304,160 380,200 475,250 760,400 950,500 1,520,800 1,901,000 3,802,000 7,604,000

Collatz Trajectory (129 steps to reach 1)

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

7,604,000 3,802,000 1,901,000 950,500 475,250 237,625 712,876 356,438 178,219 534,658 267,329 801,988 400,994 200,497 601,492 300,746 150,373 451,120 225,560 112,780 56,390 28,195 84,586 42,293 126,880 63,440 31,720 15,860 7,930 3,965 11,896 5,948 2,974 1,487 4,462 2,231 6,694 3,347 10,042 5,021 15,064 7,532 3,766 1,883 5,650 2,825 8,476 4,238 2,119 6,358 3,179 9,538 4,769 14,308 7,154 3,577 10,732 5,366 2,683 8,050

← Previous Integer #7,603,999 Browse Full Index Next Integer #7,604,001 →