5,657,600

2¹⁰ × 5² × 13 × 17

5,657,600 factors as 2^10 × 5^2 × 13 × 17. Its 132 positive divisors give a proper-divisor sum of 10,333,564, so this integer is abundant. The Collatz stopping time is 139 steps.

Prime Factor Structure

Factorization String 2^10 × 5^2 × 13 × 17

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 132

Divisor Sum (σ) 15,991,164

Proper Divisor Sum 10,333,564

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #5657599 ← → #5657623

Radix Representation

Decimal	5657600
Binary	10101100101010000000000 (23 bits)
Octal	0o25452000
Hexadecimal	0x565400

Divisor Catalog (60 of 132)

1 2 4 5 8 10 13 16 17 20 25 26 32 34 40 50 52 64 65 68 80 85 100 104 128 130 136 160 170 200 208 221 256 260 272 320 325 340 400 416 425 442 512 520 544 640 650 680 800 832 850 884 1,024 1,040 1,088 1,105 1,280 1,300 1,360 1,600

Collatz Trajectory (139 steps to reach 1)

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

5,657,600 2,828,800 1,414,400 707,200 353,600 176,800 88,400 44,200 22,100 11,050 5,525 16,576 8,288 4,144 2,072 1,036 518 259 778 389 1,168 584 292 146 73 220 110 55 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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