2,605,700

2² × 5² × 71 × 367

2,605,700 factors as 2^2 × 5^2 × 71 × 367. Its 36 positive divisors give a proper-divisor sum of 3,143,932, so this integer is abundant. The Collatz stopping time is 218 steps.

Prime Factor Structure

Factorization String 2^2 × 5^2 × 71 × 367

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 5,749,632

Proper Divisor Sum 3,143,932

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #2605663 ← → #2605741

Radix Representation

Decimal	2605700
Binary	1001111100001010000100 (22 bits)
Octal	0o11741204
Hexadecimal	0x27C284

Divisor Catalog (36)

1 2 4 5 10 20 25 50 71 100 142 284 355 367 710 734 1,420 1,468 1,775 1,835 3,550 3,670 7,100 7,340 9,175 18,350 26,057 36,700 52,114 104,228 130,285 260,570 521,140 651,425 1,302,850 2,605,700

Collatz Trajectory (218 steps to reach 1)

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

2,605,700 1,302,850 651,425 1,954,276 977,138 488,569 1,465,708 732,854 366,427 1,099,282 549,641 1,648,924 824,462 412,231 1,236,694 618,347 1,855,042 927,521 2,782,564 1,391,282 695,641 2,086,924 1,043,462 521,731 1,565,194 782,597 2,347,792 1,173,896 586,948 293,474 146,737 440,212 220,106 110,053 330,160 165,080 82,540 41,270 20,635 61,906 30,953 92,860 46,430 23,215 69,646 34,823 104,470 52,235 156,706 78,353 235,060 117,530 58,765 176,296 88,148 44,074 22,037 66,112 33,056 16,528

← Previous Integer #2,605,699 Browse Full Index Next Integer #2,605,701 →