2,532,840

2³ × 3 × 5 × 21107

2,532,840 factors as 2^3 × 3 × 5 × 21107. Its 32 positive divisors give a proper-divisor sum of 5,066,040, so this integer is abundant. The Collatz stopping time is 81 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5 × 21107

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 7,598,880

Proper Divisor Sum 5,066,040

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2532839 ← → #2532853

Radix Representation

Decimal	2532840
Binary	1001101010010111101000 (22 bits)
Octal	0o11522750
Hexadecimal	0x26A5E8

Divisor Catalog (32)

1 2 3 4 5 6 8 10 12 15 20 24 30 40 60 120 21,107 42,214 63,321 84,428 105,535 126,642 168,856 211,070 253,284 316,605 422,140 506,568 633,210 844,280 1,266,420 2,532,840

Collatz Trajectory (81 steps to reach 1)

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

2,532,840 1,266,420 633,210 316,605 949,816 474,908 237,454 118,727 356,182 178,091 534,274 267,137 801,412 400,706 200,353 601,060 300,530 150,265 450,796 225,398 112,699 338,098 169,049 507,148 253,574 126,787 380,362 190,181 570,544 285,272 142,636 71,318 35,659 106,978 53,489 160,468 80,234 40,117 120,352 60,176 30,088 15,044 7,522 3,761 11,284 5,642 2,821 8,464 4,232 2,116 1,058 529 1,588 794 397 1,192 596 298 149 448

← Previous Integer #2,532,839 Browse Full Index Next Integer #2,532,841 →