2,006,056

2³ × 13 × 19289

2,006,056 factors as 2^3 × 13 × 19289. Its 16 positive divisors give a proper-divisor sum of 2,044,844, so this integer is abundant. The Collatz stopping time is 166 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 19289

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,050,900

Proper Divisor Sum 2,044,844

Digit Sum / Digital Root 19 (Root: 1)

Adjacent Primes #2006033 ← → #2006071

Radix Representation

Decimal	2006056
Binary	111101001110000101000 (21 bits)
Octal	0o7516050
Hexadecimal	0x1E9C28

Divisor Catalog (16)

1 2 4 8 13 26 52 104 19,289 38,578 77,156 154,312 250,757 501,514 1,003,028 2,006,056

Collatz Trajectory (166 steps to reach 1)

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

2,006,056 1,003,028 501,514 250,757 752,272 376,136 188,068 94,034 47,017 141,052 70,526 35,263 105,790 52,895 158,686 79,343 238,030 119,015 357,046 178,523 535,570 267,785 803,356 401,678 200,839 602,518 301,259 903,778 451,889 1,355,668 677,834 338,917 1,016,752 508,376 254,188 127,094 63,547 190,642 95,321 285,964 142,982 71,491 214,474 107,237 321,712 160,856 80,428 40,214 20,107 60,322 30,161 90,484 45,242 22,621 67,864 33,932 16,966 8,483 25,450 12,725

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,006,055 Browse Full Index Next Integer #2,006,057 →