5,638,080

2⁶ × 3 × 5 × 7 × 839

5,638,080 factors as 2^6 × 3 × 5 × 7 × 839. Its 112 positive divisors give a proper-divisor sum of 14,844,480, so this integer is abundant. The Collatz stopping time is 108 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 5 × 7 × 839

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 112

Divisor Sum (σ) 20,482,560

Proper Divisor Sum 14,844,480

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #5638057 ← → #5638103

Radix Representation

Decimal	5638080
Binary	10101100000011111000000 (23 bits)
Octal	0o25403700
Hexadecimal	0x5607C0

Divisor Catalog (60 of 112)

1 2 3 4 5 6 7 8 10 12 14 15 16 20 21 24 28 30 32 35 40 42 48 56 60 64 70 80 84 96 105 112 120 140 160 168 192 210 224 240 280 320 336 420 448 480 560 672 839 840 960 1,120 1,344 1,678 1,680 2,240 2,517 3,356 3,360 4,195

Collatz Trajectory (108 steps to reach 1)

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

5,638,080 2,819,040 1,409,520 704,760 352,380 176,190 88,095 264,286 132,143 396,430 198,215 594,646 297,323 891,970 445,985 1,337,956 668,978 334,489 1,003,468 501,734 250,867 752,602 376,301 1,128,904 564,452 282,226 141,113 423,340 211,670 105,835 317,506 158,753 476,260 238,130 119,065 357,196 178,598 89,299 267,898 133,949 401,848 200,924 100,462 50,231 150,694 75,347 226,042 113,021 339,064 169,532 84,766 42,383 127,150 63,575 190,726 95,363 286,090 143,045 429,136 214,568

← Previous Integer #5,638,079 Browse Full Index Next Integer #5,638,081 →