2,136,552

2³ × 3 × 11 × 8093

2,136,552 factors as 2^3 × 3 × 11 × 8093. Its 32 positive divisors give a proper-divisor sum of 3,691,128, so this integer is abundant. The Collatz stopping time is 122 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 11 × 8093

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 5,827,680

Proper Divisor Sum 3,691,128

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2136527 ← → #2136553

Radix Representation

Decimal	2136552
Binary	1000001001100111101000 (22 bits)
Octal	0o10114750
Hexadecimal	0x2099E8

Divisor Catalog (32)

Collatz Trajectory (122 steps to reach 1)

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

2,136,552 1,068,276 534,138 267,069 801,208 400,604 200,302 100,151 300,454 150,227 450,682 225,341 676,024 338,012 169,006 84,503 253,510 126,755 380,266 190,133 570,400 285,200 142,600 71,300 35,650 17,825 53,476 26,738 13,369 40,108 20,054 10,027 30,082 15,041 45,124 22,562 11,281 33,844 16,922 8,461 25,384 12,692 6,346 3,173 9,520 4,760 2,380 1,190 595 1,786 893 2,680 1,340 670 335 1,006 503 1,510 755 2,266

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,136,551 Browse Full Index Next Integer #2,136,553 →