6,609,765

3 × 5 × 440651

6,609,765 factors as 3 × 5 × 440651. Its 8 positive divisors give a proper-divisor sum of 3,965,883, so this integer is deficient. The Collatz stopping time is 85 steps.

Prime Factor Structure

Factorization String 3 × 5 × 440651

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 10,575,648

Proper Divisor Sum 3,965,883

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #6609761 ← → #6609769

Radix Representation

Decimal	6609765
Binary	11001001101101101100101 (23 bits)
Octal	0o31155545
Hexadecimal	0x64DB65

Divisor Catalog (8)

1 3 5 15 440,651 1,321,953 2,203,255 6,609,765

Collatz Trajectory (85 steps to reach 1)

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

6,609,765 19,829,296 9,914,648 4,957,324 2,478,662 1,239,331 3,717,994 1,858,997 5,576,992 2,788,496 1,394,248 697,124 348,562 174,281 522,844 261,422 130,711 392,134 196,067 588,202 294,101 882,304 441,152 220,576 110,288 55,144 27,572 13,786 6,893 20,680 10,340 5,170 2,585 7,756 3,878 1,939 5,818 2,909 8,728 4,364 2,182 1,091 3,274 1,637 4,912 2,456 1,228 614 307 922 461 1,384 692 346 173 520 260 130 65 196

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,609,764 Browse Full Index Next Integer #6,609,766 →