5,017,500

2² × 3² × 5⁴ × 223

5,017,500 factors as 2^2 × 3^2 × 5^4 × 223. Its 90 positive divisors give a proper-divisor sum of 10,902,404, so this integer is abundant. The Collatz stopping time is 157 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 5^4 × 223

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 90

Divisor Sum (σ) 15,919,904

Proper Divisor Sum 10,902,404

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #5017489 ← → #5017511

Radix Representation

Decimal	5017500
Binary	10011001000111110011100 (23 bits)
Octal	0o23107634
Hexadecimal	0x4C8F9C

Divisor Catalog (60 of 90)

1 2 3 4 5 6 9 10 12 15 18 20 25 30 36 45 50 60 75 90 100 125 150 180 223 225 250 300 375 446 450 500 625 669 750 892 900 1,115 1,125 1,250 1,338 1,500 1,875 2,007 2,230 2,250 2,500 2,676 3,345 3,750 4,014 4,460 4,500 5,575 5,625 6,690 7,500 8,028 10,035 11,150

Collatz Trajectory (157 steps to reach 1)

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

5,017,500 2,508,750 1,254,375 3,763,126 1,881,563 5,644,690 2,822,345 8,467,036 4,233,518 2,116,759 6,350,278 3,175,139 9,525,418 4,762,709 14,288,128 7,144,064 3,572,032 1,786,016 893,008 446,504 223,252 111,626 55,813 167,440 83,720 41,860 20,930 10,465 31,396 15,698 7,849 23,548 11,774 5,887 17,662 8,831 26,494 13,247 39,742 19,871 59,614 29,807 89,422 44,711 134,134 67,067 201,202 100,601 301,804 150,902 75,451 226,354 113,177 339,532 169,766 84,883 254,650 127,325 381,976 190,988

← Previous Integer #5,017,499 Browse Full Index Next Integer #5,017,501 →