5,456,250

2 × 3² × 5⁵ × 97

5,456,250 factors as 2 × 3^2 × 5^5 × 97. Its 72 positive divisors give a proper-divisor sum of 9,472,482, so this integer is abundant. The Collatz stopping time is 232 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5^5 × 97

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 14,928,732

Proper Divisor Sum 9,472,482

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #5456237 ← → #5456273

Radix Representation

Decimal	5456250
Binary	10100110100000101111010 (23 bits)
Octal	0o24640572
Hexadecimal	0x53417A

Divisor Catalog (60 of 72)

1 2 3 5 6 9 10 15 18 25 30 45 50 75 90 97 125 150 194 225 250 291 375 450 485 582 625 750 873 970 1,125 1,250 1,455 1,746 1,875 2,250 2,425 2,910 3,125 3,750 4,365 4,850 5,625 6,250 7,275 8,730 9,375 11,250 12,125 14,550 18,750 21,825 24,250 28,125 36,375 43,650 56,250 60,625 72,750 109,125

Collatz Trajectory (232 steps to reach 1)

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

5,456,250 2,728,125 8,184,376 4,092,188 2,046,094 1,023,047 3,069,142 1,534,571 4,603,714 2,301,857 6,905,572 3,452,786 1,726,393 5,179,180 2,589,590 1,294,795 3,884,386 1,942,193 5,826,580 2,913,290 1,456,645 4,369,936 2,184,968 1,092,484 546,242 273,121 819,364 409,682 204,841 614,524 307,262 153,631 460,894 230,447 691,342 345,671 1,037,014 518,507 1,555,522 777,761 2,333,284 1,166,642 583,321 1,749,964 874,982 437,491 1,312,474 656,237 1,968,712 984,356 492,178 246,089 738,268 369,134 184,567 553,702 276,851 830,554 415,277 1,245,832

← Previous Integer #5,456,249 Browse Full Index Next Integer #5,456,251 →