5,596,128

2⁵ × 3⁴ × 17 × 127

5,596,128 factors as 2^5 × 3^4 × 17 × 127. Its 120 positive divisors give a proper-divisor sum of 11,967,264, so this integer is abundant. The Collatz stopping time is 139 steps.

Prime Factor Structure

Factorization String 2^5 × 3^4 × 17 × 127

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 120

Divisor Sum (σ) 17,563,392

Proper Divisor Sum 11,967,264

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #5596121 ← → #5596133

Radix Representation

Decimal	5596128
Binary	10101010110001111100000 (23 bits)
Octal	0o25261740
Hexadecimal	0x5563E0

Divisor Catalog (60 of 120)

1 2 3 4 6 8 9 12 16 17 18 24 27 32 34 36 48 51 54 68 72 81 96 102 108 127 136 144 153 162 204 216 254 272 288 306 324 381 408 432 459 508 544 612 648 762 816 864 918 1,016 1,143 1,224 1,296 1,377 1,524 1,632 1,836 2,032 2,159 2,286

Collatz Trajectory (139 steps to reach 1)

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

5,596,128 2,798,064 1,399,032 699,516 349,758 174,879 524,638 262,319 786,958 393,479 1,180,438 590,219 1,770,658 885,329 2,655,988 1,327,994 663,997 1,991,992 995,996 497,998 248,999 746,998 373,499 1,120,498 560,249 1,680,748 840,374 420,187 1,260,562 630,281 1,890,844 945,422 472,711 1,418,134 709,067 2,127,202 1,063,601 3,190,804 1,595,402 797,701 2,393,104 1,196,552 598,276 299,138 149,569 448,708 224,354 112,177 336,532 168,266 84,133 252,400 126,200 63,100 31,550 15,775 47,326 23,663 70,990 35,495

← Previous Integer #5,596,127 Browse Full Index Next Integer #5,596,129 →