1,608,366

2 × 3 × 181 × 1481

1,608,366 factors as 2 × 3 × 181 × 1481. Its 16 positive divisors give a proper-divisor sum of 1,628,322, so this integer is abundant. The Collatz stopping time is 70 steps.

Prime Factor Structure

Factorization String 2 × 3 × 181 × 1481

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,236,688

Proper Divisor Sum 1,628,322

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1608359 ← → #1608371

Radix Representation

Decimal	1608366
Binary	110001000101010101110 (21 bits)
Octal	0o6105256
Hexadecimal	0x188AAE

Divisor Catalog (16)

1 2 3 6 181 362 543 1,086 1,481 2,962 4,443 8,886 268,061 536,122 804,183 1,608,366

Collatz Trajectory (70 steps to reach 1)

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

1,608,366 804,183 2,412,550 1,206,275 3,618,826 1,809,413 5,428,240 2,714,120 1,357,060 678,530 339,265 1,017,796 508,898 254,449 763,348 381,674 190,837 572,512 286,256 143,128 71,564 35,782 17,891 53,674 26,837 80,512 40,256 20,128 10,064 5,032 2,516 1,258 629 1,888 944 472 236 118 59 178 89 268 134 67 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,608,365 Browse Full Index Next Integer #1,608,367 →