11,633,560

2³ × 5 × 290839

11,633,560 factors as 2^3 × 5 × 290839. Its 16 positive divisors give a proper-divisor sum of 14,542,040, so this integer is abundant. The Collatz stopping time is 140 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 290839

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 26,175,600

Proper Divisor Sum 14,542,040

Digit Sum / Digital Root 25 (Root: 7)

Adjacent Primes #11633549 ← → #11633569

Radix Representation

Decimal	11633560
Binary	101100011000001110011000 (24 bits)
Octal	0o54301630
Hexadecimal	0xB18398

Divisor Catalog (16)

1 2 4 5 8 10 20 40 290,839 581,678 1,163,356 1,454,195 2,326,712 2,908,390 5,816,780 11,633,560

Collatz Trajectory (140 steps to reach 1)

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

11,633,560 5,816,780 2,908,390 1,454,195 4,362,586 2,181,293 6,543,880 3,271,940 1,635,970 817,985 2,453,956 1,226,978 613,489 1,840,468 920,234 460,117 1,380,352 690,176 345,088 172,544 86,272 43,136 21,568 10,784 5,392 2,696 1,348 674 337 1,012 506 253 760 380 190 95 286 143 430 215 646 323 970 485 1,456 728 364 182 91 274 137 412 206 103 310 155 466 233 700 350

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #11,633,559 Browse Full Index Next Integer #11,633,561 →