3,920,106

2 × 3 × 241 × 2711

3,920,106 factors as 2 × 3 × 241 × 2711. Its 16 positive divisors give a proper-divisor sum of 3,955,542, so this integer is abundant. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 2 × 3 × 241 × 2711

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,875,648

Proper Divisor Sum 3,955,542

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #3920089 ← → #3920131

Radix Representation

Decimal	3920106
Binary	1110111101000011101010 (22 bits)
Octal	0o16750352
Hexadecimal	0x3BD0EA

Divisor Catalog (16)

1 2 3 6 241 482 723 1,446 2,711 5,422 8,133 16,266 653,351 1,306,702 1,960,053 3,920,106

Collatz Trajectory (185 steps to reach 1)

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

3,920,106 1,960,053 5,880,160 2,940,080 1,470,040 735,020 367,510 183,755 551,266 275,633 826,900 413,450 206,725 620,176 310,088 155,044 77,522 38,761 116,284 58,142 29,071 87,214 43,607 130,822 65,411 196,234 98,117 294,352 147,176 73,588 36,794 18,397 55,192 27,596 13,798 6,899 20,698 10,349 31,048 15,524 7,762 3,881 11,644 5,822 2,911 8,734 4,367 13,102 6,551 19,654 9,827 29,482 14,741 44,224 22,112 11,056 5,528 2,764 1,382 691

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,920,105 Browse Full Index Next Integer #3,920,107 →