866,994

2 × 3 × 229 × 631

866,994 factors as 2 × 3 × 229 × 631. Its 16 positive divisors give a proper-divisor sum of 877,326, so this integer is abundant. The Collatz stopping time is 188 steps.

Prime Factor Structure

Factorization String 2 × 3 × 229 × 631

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,744,320

Proper Divisor Sum 877,326

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #866969 ← → #867001

Radix Representation

Decimal	866994
Binary	11010011101010110010 (20 bits)
Octal	0o3235262
Hexadecimal	0xD3AB2

Divisor Catalog (16)

1 2 3 6 229 458 631 687 1,262 1,374 1,893 3,786 144,499 288,998 433,497 866,994

Collatz Trajectory (188 steps to reach 1)

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

866,994 433,497 1,300,492 650,246 325,123 975,370 487,685 1,463,056 731,528 365,764 182,882 91,441 274,324 137,162 68,581 205,744 102,872 51,436 25,718 12,859 38,578 19,289 57,868 28,934 14,467 43,402 21,701 65,104 32,552 16,276 8,138 4,069 12,208 6,104 3,052 1,526 763 2,290 1,145 3,436 1,718 859 2,578 1,289 3,868 1,934 967 2,902 1,451 4,354 2,177 6,532 3,266 1,633 4,900 2,450 1,225 3,676 1,838 919

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #866,993 Browse Full Index Next Integer #866,995 →