866,706

2 × 3 × 144451

866,706 factors as 2 × 3 × 144451. Its 8 positive divisors give a proper-divisor sum of 866,718, so this integer is abundant. The Collatz stopping time is 180 steps.

Prime Factor Structure

Factorization String 2 × 3 × 144451

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 1,733,424

Proper Divisor Sum 866,718

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #866693 ← → #866707

Radix Representation

Decimal	866706
Binary	11010011100110010010 (20 bits)
Octal	0o3234622
Hexadecimal	0xD3992

Divisor Catalog (8)

1 2 3 6 144,451 288,902 433,353 866,706

Collatz Trajectory (180 steps to reach 1)

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

866,706 433,353 1,300,060 650,030 325,015 975,046 487,523 1,462,570 731,285 2,193,856 1,096,928 548,464 274,232 137,116 68,558 34,279 102,838 51,419 154,258 77,129 231,388 115,694 57,847 173,542 86,771 260,314 130,157 390,472 195,236 97,618 48,809 146,428 73,214 36,607 109,822 54,911 164,734 82,367 247,102 123,551 370,654 185,327 555,982 277,991 833,974 416,987 1,250,962 625,481 1,876,444 938,222 469,111 1,407,334 703,667 2,111,002 1,055,501 3,166,504 1,583,252 791,626 395,813 1,187,440

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #866,705 Browse Full Index Next Integer #866,707 →