6,066,660
22 × 3 × 5 × 101111
Abundant
Even
Composite
6,066,660 factors as 2^2 × 3 × 5 × 101111. Its 24 positive divisors give a proper-divisor sum of 10,920,156, so this integer is abundant. The Collatz stopping time is 134 steps.
Resources
Prime Factor Structure
Factorization String
2^2 × 3 × 5 × 101111
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
16,986,816
Proper Divisor Sum
10,920,156
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#6066659 ← → #6066661
Radix Representation
| Decimal | 6066660 |
| Binary | 10111001001000111100100 (23 bits) |
| Octal | 0o27110744 |
| Hexadecimal | 0x5C91E4 |
Divisor Catalog (5 of 24)
Collatz Trajectory (134 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.