3,304,800
25 × 35 × 52 × 17
Abundant
Even
Composite
3,304,800 factors as 2^5 × 3^5 × 5^2 × 17. Its 216 positive divisors give a proper-divisor sum of 9,491,256, so this integer is abundant. The Collatz stopping time is 84 steps.
Resources
Prime Factor Structure
Factorization String
2^5 × 3^5 × 5^2 × 17
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
216
Divisor Sum (σ)
12,796,056
Proper Divisor Sum
9,491,256
Digit Sum / Digital Root
18 (Root: 9)
Adjacent Primes
#3304787 ← → #3304813
Radix Representation
| Decimal | 3304800 |
| Binary | 1100100110110101100000 (22 bits) |
| Octal | 0o14466540 |
| Hexadecimal | 0x326D60 |
Divisor Catalog (5 of 216)
Collatz Trajectory (84 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.