1,666,454

2 × 491 × 1697

1,666,454 factors as 2 × 491 × 1697. Its 8 positive divisors give a proper-divisor sum of 839,794, so this integer is deficient. The Collatz stopping time is 137 steps.

Prime Factor Structure

Factorization String 2 × 491 × 1697

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,506,248

Proper Divisor Sum 839,794

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #1666447 ← → #1666477

Radix Representation

Decimal	1666454
Binary	110010110110110010110 (21 bits)
Octal	0o6266626
Hexadecimal	0x196D96

Divisor Catalog (8)

1 2 491 982 1,697 3,394 833,227 1,666,454

Collatz Trajectory (137 steps to reach 1)

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

1,666,454 833,227 2,499,682 1,249,841 3,749,524 1,874,762 937,381 2,812,144 1,406,072 703,036 351,518 175,759 527,278 263,639 790,918 395,459 1,186,378 593,189 1,779,568 889,784 444,892 222,446 111,223 333,670 166,835 500,506 250,253 750,760 375,380 187,690 93,845 281,536 140,768 70,384 35,192 17,596 8,798 4,399 13,198 6,599 19,798 9,899 29,698 14,849 44,548 22,274 11,137 33,412 16,706 8,353 25,060 12,530 6,265 18,796 9,398 4,699 14,098 7,049 21,148 10,574

← Previous Integer #1,666,453 Browse Full Index Next Integer #1,666,455 →