3,011,766

2 × 3 × 19 × 29 × 911

3,011,766 factors as 2 × 3 × 19 × 29 × 911. Its 32 positive divisors give a proper-divisor sum of 3,554,634, so this integer is abundant. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2 × 3 × 19 × 29 × 911

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 6,566,400

Proper Divisor Sum 3,554,634

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3011759 ← → #3011791

Radix Representation

Decimal	3011766
Binary	1011011111010010110110 (22 bits)
Octal	0o13372266
Hexadecimal	0x2DF4B6

Divisor Catalog (32)

1 2 3 6 19 29 38 57 58 87 114 174 551 911 1,102 1,653 1,822 2,733 3,306 5,466 17,309 26,419 34,618 51,927 52,838 79,257 103,854 158,514 501,961 1,003,922 1,505,883 3,011,766

Collatz Trajectory (164 steps to reach 1)

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

3,011,766 1,505,883 4,517,650 2,258,825 6,776,476 3,388,238 1,694,119 5,082,358 2,541,179 7,623,538 3,811,769 11,435,308 5,717,654 2,858,827 8,576,482 4,288,241 12,864,724 6,432,362 3,216,181 9,648,544 4,824,272 2,412,136 1,206,068 603,034 301,517 904,552 452,276 226,138 113,069 339,208 169,604 84,802 42,401 127,204 63,602 31,801 95,404 47,702 23,851 71,554 35,777 107,332 53,666 26,833 80,500 40,250 20,125 60,376 30,188 15,094 7,547 22,642 11,321 33,964 16,982 8,491 25,474 12,737 38,212 19,106

← Previous Integer #3,011,765 Browse Full Index Next Integer #3,011,767 →