6,604,470
2 × 33 × 5 × 61 × 401
Abundant
Even
Composite
6,604,470 factors as 2 × 3^3 × 5 × 61 × 401. Its 64 positive divisors give a proper-divisor sum of 11,340,810, so this integer is abundant. The Collatz stopping time is 196 steps.
Prime Factor Structure
Factorization String
2 × 3^3 × 5 × 61 × 401
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
17,945,280
Proper Divisor Sum
11,340,810
Digit Sum / Digital Root
27 (Root: 9)
Radix Representation
| Decimal | 6604470 |
| Binary | 11001001100011010110110 (23 bits) |
| Octal | 0o31143266 |
| Hexadecimal | 0x64C6B6 |
Divisor Catalog (60 of 64)
Collatz Trajectory (196 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
More profiles
Browse other published profiles and their separate link collections.
No other profiles in this collection.