3,066,176

2⁶ × 23 × 2083

3,066,176 factors as 2^6 × 23 × 2083. Its 28 positive divisors give a proper-divisor sum of 3,285,856, so this integer is abundant. The Collatz stopping time is 195 steps.

Prime Factor Structure

Factorization String 2^6 × 23 × 2083

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 28

Divisor Sum (σ) 6,352,032

Proper Divisor Sum 3,285,856

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #3066169 ← → #3066187

Radix Representation

Decimal	3066176
Binary	1011101100100101000000 (22 bits)
Octal	0o13544500
Hexadecimal	0x2EC940

Divisor Catalog (28)

Collatz Trajectory (195 steps to reach 1)

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

3,066,176 1,533,088 766,544 383,272 191,636 95,818 47,909 143,728 71,864 35,932 17,966 8,983 26,950 13,475 40,426 20,213 60,640 30,320 15,160 7,580 3,790 1,895 5,686 2,843 8,530 4,265 12,796 6,398 3,199 9,598 4,799 14,398 7,199 21,598 10,799 32,398 16,199 48,598 24,299 72,898 36,449 109,348 54,674 27,337 82,012 41,006 20,503 61,510 30,755 92,266 46,133 138,400 69,200 34,600 17,300 8,650 4,325 12,976 6,488 3,244

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,066,175 Browse Full Index Next Integer #3,066,177 →