6,608,166
2 × 3 × 947 × 1163
Abundant
Even
Composite
6,608,166 factors as 2 × 3 × 947 × 1163. Its 16 positive divisors give a proper-divisor sum of 6,633,498, so this integer is abundant. The Collatz stopping time is 165 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 947 × 1163
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
13,241,664
Proper Divisor Sum
6,633,498
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#6608149 ← → #6608167
Radix Representation
| Decimal | 6608166 |
| Binary | 11001001101010100100110 (23 bits) |
| Octal | 0o31152446 |
| Hexadecimal | 0x64D526 |
Divisor Catalog (5 of 16)
Collatz Trajectory (165 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
Showing the first 5 trajectory entries; the stopping-time total above is unchanged.