1,665,954

2 × 3³ × 30851

1,665,954 factors as 2 × 3^3 × 30851. Its 16 positive divisors give a proper-divisor sum of 2,036,286, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 30851

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,702,240

Proper Divisor Sum 2,036,286

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #1665943 ← → #1665967

Radix Representation

Decimal	1665954
Binary	110010110101110100010 (21 bits)
Octal	0o6265642
Hexadecimal	0x196BA2

Divisor Catalog (16)

1 2 3 6 9 18 27 54 30,851 61,702 92,553 185,106 277,659 555,318 832,977 1,665,954

Collatz Trajectory (132 steps to reach 1)

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

1,665,954 832,977 2,498,932 1,249,466 624,733 1,874,200 937,100 468,550 234,275 702,826 351,413 1,054,240 527,120 263,560 131,780 65,890 32,945 98,836 49,418 24,709 74,128 37,064 18,532 9,266 4,633 13,900 6,950 3,475 10,426 5,213 15,640 7,820 3,910 1,955 5,866 2,933 8,800 4,400 2,200 1,100 550 275 826 413 1,240 620 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,665,953 Browse Full Index Next Integer #1,665,955 →