610,866

2 × 3² × 33937

610,866 factors as 2 × 3^2 × 33937. Its 12 positive divisors give a proper-divisor sum of 712,716, so this integer is abundant. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 33937

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 1,323,582

Proper Divisor Sum 712,716

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #610849 ← → #610867

Radix Representation

Decimal	610866
Binary	10010101001000110010 (20 bits)
Octal	0o2251062
Hexadecimal	0x95232

Divisor Catalog (12)

1 2 3 6 9 18 33,937 67,874 101,811 203,622 305,433 610,866

Collatz Trajectory (97 steps to reach 1)

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

610,866 305,433 916,300 458,150 229,075 687,226 343,613 1,030,840 515,420 257,710 128,855 386,566 193,283 579,850 289,925 869,776 434,888 217,444 108,722 54,361 163,084 81,542 40,771 122,314 61,157 183,472 91,736 45,868 22,934 11,467 34,402 17,201 51,604 25,802 12,901 38,704 19,352 9,676 4,838 2,419 7,258 3,629 10,888 5,444 2,722 1,361 4,084 2,042 1,021 3,064 1,532 766 383 1,150 575 1,726 863 2,590 1,295 3,886

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #610,865 Browse Full Index Next Integer #610,867 →