2,000,601

3² × 222289

2,000,601 factors as 3^2 × 222289. Its 6 positive divisors give a proper-divisor sum of 889,169, so this integer is deficient. The Collatz stopping time is 140 steps.

Prime Factor Structure

Factorization String 3^2 × 222289

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 6

Divisor Sum (σ) 2,889,770

Proper Divisor Sum 889,169

Digit Sum / Digital Root 9 (Root: 9)

Adjacent Primes #2000597 ← → #2000629

Radix Representation

Decimal	2000601
Binary	111101000011011011001 (21 bits)
Octal	0o7503331
Hexadecimal	0x1E86D9

Divisor Catalog (6)

1 3 9 222,289 666,867 2,000,601

Collatz Trajectory (140 steps to reach 1)

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

2,000,601 6,001,804 3,000,902 1,500,451 4,501,354 2,250,677 6,752,032 3,376,016 1,688,008 844,004 422,002 211,001 633,004 316,502 158,251 474,754 237,377 712,132 356,066 178,033 534,100 267,050 133,525 400,576 200,288 100,144 50,072 25,036 12,518 6,259 18,778 9,389 28,168 14,084 7,042 3,521 10,564 5,282 2,641 7,924 3,962 1,981 5,944 2,972 1,486 743 2,230 1,115 3,346 1,673 5,020 2,510 1,255 3,766 1,883 5,650 2,825 8,476 4,238 2,119

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,000,600 Browse Full Index Next Integer #2,000,602 →