1,608,006

2 × 3 × 283 × 947

1,608,006 factors as 2 × 3 × 283 × 947. Its 16 positive divisors give a proper-divisor sum of 1,622,778, so this integer is abundant. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 2 × 3 × 283 × 947

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,230,784

Proper Divisor Sum 1,622,778

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1607987 ← → #1608007

Radix Representation

Decimal	1608006
Binary	110001000100101000110 (21 bits)
Octal	0o6104506
Hexadecimal	0x188946

Divisor Catalog (16)

1 2 3 6 283 566 849 947 1,698 1,894 2,841 5,682 268,001 536,002 804,003 1,608,006

Collatz Trajectory (176 steps to reach 1)

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

1,608,006 804,003 2,412,010 1,206,005 3,618,016 1,809,008 904,504 452,252 226,126 113,063 339,190 169,595 508,786 254,393 763,180 381,590 190,795 572,386 286,193 858,580 429,290 214,645 643,936 321,968 160,984 80,492 40,246 20,123 60,370 30,185 90,556 45,278 22,639 67,918 33,959 101,878 50,939 152,818 76,409 229,228 114,614 57,307 171,922 85,961 257,884 128,942 64,471 193,414 96,707 290,122 145,061 435,184 217,592 108,796 54,398 27,199 81,598 40,799 122,398 61,199

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,608,005 Browse Full Index Next Integer #1,608,007 →