2,042,004

2² × 3 × 170167

2,042,004 factors as 2^2 × 3 × 170167. Its 12 positive divisors give a proper-divisor sum of 2,722,700, so this integer is abundant. The Collatz stopping time is 184 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 170167

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,764,704

Proper Divisor Sum 2,722,700

Digit Sum / Digital Root 12 (Root: 3)

Adjacent Primes #2041997 ← → #2042017

Radix Representation

Decimal	2042004
Binary	111110010100010010100 (21 bits)
Octal	0o7624224
Hexadecimal	0x1F2894

Divisor Catalog (12)

1 2 3 4 6 12 170,167 340,334 510,501 680,668 1,021,002 2,042,004

Collatz Trajectory (184 steps to reach 1)

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

2,042,004 1,021,002 510,501 1,531,504 765,752 382,876 191,438 95,719 287,158 143,579 430,738 215,369 646,108 323,054 161,527 484,582 242,291 726,874 363,437 1,090,312 545,156 272,578 136,289 408,868 204,434 102,217 306,652 153,326 76,663 229,990 114,995 344,986 172,493 517,480 258,740 129,370 64,685 194,056 97,028 48,514 24,257 72,772 36,386 18,193 54,580 27,290 13,645 40,936 20,468 10,234 5,117 15,352 7,676 3,838 1,919 5,758 2,879 8,638 4,319 12,958

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,042,003 Browse Full Index Next Integer #2,042,005 →