5,925,600

2⁵ × 3² × 5² × 823

5,925,600 factors as 2^5 × 3^2 × 5^2 × 823. Its 108 positive divisors give a proper-divisor sum of 14,994,936, so this integer is abundant. The Collatz stopping time is 170 steps.

Prime Factor Structure

Factorization String 2^5 × 3^2 × 5^2 × 823

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 108

Divisor Sum (σ) 20,920,536

Proper Divisor Sum 14,994,936

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #5925593 ← → #5925611

Radix Representation

Decimal	5925600
Binary	10110100110101011100000 (23 bits)
Octal	0o26465340
Hexadecimal	0x5A6AE0

Divisor Catalog (60 of 108)

1 2 3 4 5 6 8 9 10 12 15 16 18 20 24 25 30 32 36 40 45 48 50 60 72 75 80 90 96 100 120 144 150 160 180 200 225 240 288 300 360 400 450 480 600 720 800 823 900 1,200 1,440 1,646 1,800 2,400 2,469 3,292 3,600 4,115 4,938 6,584

Collatz Trajectory (170 steps to reach 1)

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

5,925,600 2,962,800 1,481,400 740,700 370,350 185,175 555,526 277,763 833,290 416,645 1,249,936 624,968 312,484 156,242 78,121 234,364 117,182 58,591 175,774 87,887 263,662 131,831 395,494 197,747 593,242 296,621 889,864 444,932 222,466 111,233 333,700 166,850 83,425 250,276 125,138 62,569 187,708 93,854 46,927 140,782 70,391 211,174 105,587 316,762 158,381 475,144 237,572 118,786 59,393 178,180 89,090 44,545 133,636 66,818 33,409 100,228 50,114 25,057 75,172 37,586

← Previous Integer #5,925,599 Browse Full Index Next Integer #5,925,601 →