2,609,860

2² × 5 × 11 × 11863

2,609,860 factors as 2^2 × 5 × 11 × 11863. Its 24 positive divisors give a proper-divisor sum of 3,369,596, so this integer is abundant. The Collatz stopping time is 94 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 11 × 11863

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 5,979,456

Proper Divisor Sum 3,369,596

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #2609813 ← → #2609899

Radix Representation

Decimal	2609860
Binary	1001111101001011000100 (22 bits)
Octal	0o11751304
Hexadecimal	0x27D2C4

Divisor Catalog (24)

1 2 4 5 10 11 20 22 44 55 110 220 11,863 23,726 47,452 59,315 118,630 130,493 237,260 260,986 521,972 652,465 1,304,930 2,609,860

Collatz Trajectory (94 steps to reach 1)

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

2,609,860 1,304,930 652,465 1,957,396 978,698 489,349 1,468,048 734,024 367,012 183,506 91,753 275,260 137,630 68,815 206,446 103,223 309,670 154,835 464,506 232,253 696,760 348,380 174,190 87,095 261,286 130,643 391,930 195,965 587,896 293,948 146,974 73,487 220,462 110,231 330,694 165,347 496,042 248,021 744,064 372,032 186,016 93,008 46,504 23,252 11,626 5,813 17,440 8,720 4,360 2,180 1,090 545 1,636 818 409 1,228 614 307 922 461

← Previous Integer #2,609,859 Browse Full Index Next Integer #2,609,861 →