2,004,665

5 × 13 × 30841

2,004,665 factors as 5 × 13 × 30841. Its 8 positive divisors give a proper-divisor sum of 586,063, so this integer is deficient. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 5 × 13 × 30841

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,590,728

Proper Divisor Sum 586,063

Digit Sum / Digital Root 23 (Root: 5)

Adjacent Primes #2004661 ← → #2004679

Radix Representation

Decimal	2004665
Binary	111101001011010111001 (21 bits)
Octal	0o7513271
Hexadecimal	0x1E96B9

Divisor Catalog (8)

1 5 13 65 30,841 154,205 400,933 2,004,665

Collatz Trajectory (114 steps to reach 1)

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

2,004,665 6,013,996 3,006,998 1,503,499 4,510,498 2,255,249 6,765,748 3,382,874 1,691,437 5,074,312 2,537,156 1,268,578 634,289 1,902,868 951,434 475,717 1,427,152 713,576 356,788 178,394 89,197 267,592 133,796 66,898 33,449 100,348 50,174 25,087 75,262 37,631 112,894 56,447 169,342 84,671 254,014 127,007 381,022 190,511 571,534 285,767 857,302 428,651 1,285,954 642,977 1,928,932 964,466 482,233 1,446,700 723,350 361,675 1,085,026 542,513 1,627,540 813,770 406,885 1,220,656 610,328 305,164 152,582 76,291

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,004,664 Browse Full Index Next Integer #2,004,666 →