2,600,586

2 × 3⁵ × 5351

2,600,586 factors as 2 × 3^5 × 5351. Its 24 positive divisors give a proper-divisor sum of 3,243,798, so this integer is abundant. The Collatz stopping time is 187 steps.

Prime Factor Structure

Factorization String 2 × 3^5 × 5351

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 5,844,384

Proper Divisor Sum 3,243,798

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2600581 ← → #2600593

Radix Representation

Decimal	2600586
Binary	1001111010111010001010 (22 bits)
Octal	0o11727212
Hexadecimal	0x27AE8A

Divisor Catalog (24)

Collatz Trajectory (187 steps to reach 1)

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

2,600,586 1,300,293 3,900,880 1,950,440 975,220 487,610 243,805 731,416 365,708 182,854 91,427 274,282 137,141 411,424 205,712 102,856 51,428 25,714 12,857 38,572 19,286 9,643 28,930 14,465 43,396 21,698 10,849 32,548 16,274 8,137 24,412 12,206 6,103 18,310 9,155 27,466 13,733 41,200 20,600 10,300 5,150 2,575 7,726 3,863 11,590 5,795 17,386 8,693 26,080 13,040 6,520 3,260 1,630 815 2,446 1,223 3,670 1,835 5,506 2,753

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,600,585 Browse Full Index Next Integer #2,600,587 →