4,082,142

2 × 3 × 17 × 31 × 1291

4,082,142 factors as 2 × 3 × 17 × 31 × 1291. Its 32 positive divisors give a proper-divisor sum of 4,848,162, so this integer is abundant. The Collatz stopping time is 242 steps.

Prime Factor Structure

Factorization String 2 × 3 × 17 × 31 × 1291

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 8,930,304

Proper Divisor Sum 4,848,162

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #4082123 ← → #4082147

Radix Representation

Decimal	4082142
Binary	1111100100100111011110 (22 bits)
Octal	0o17444736
Hexadecimal	0x3E49DE

Divisor Catalog (32)

1 2 3 6 17 31 34 51 62 93 102 186 527 1,054 1,291 1,581 2,582 3,162 3,873 7,746 21,947 40,021 43,894 65,841 80,042 120,063 131,682 240,126 680,357 1,360,714 2,041,071 4,082,142

Collatz Trajectory (242 steps to reach 1)

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

4,082,142 2,041,071 6,123,214 3,061,607 9,184,822 4,592,411 13,777,234 6,888,617 20,665,852 10,332,926 5,166,463 15,499,390 7,749,695 23,249,086 11,624,543 34,873,630 17,436,815 52,310,446 26,155,223 78,465,670 39,232,835 117,698,506 58,849,253 176,547,760 88,273,880 44,136,940 22,068,470 11,034,235 33,102,706 16,551,353 49,654,060 24,827,030 12,413,515 37,240,546 18,620,273 55,860,820 27,930,410 13,965,205 41,895,616 20,947,808 10,473,904 5,236,952 2,618,476 1,309,238 654,619 1,963,858 981,929 2,945,788 1,472,894 736,447 2,209,342 1,104,671 3,314,014 1,657,007 4,971,022 2,485,511 7,456,534 3,728,267 11,184,802 5,592,401

← Previous Integer #4,082,141 Browse Full Index Next Integer #4,082,143 →