3,285,408
25 × 3 × 7 × 4889
Abundant
Even
Composite
3,285,408 factors as 2^5 × 3 × 7 × 4889. Its 48 positive divisors give a proper-divisor sum of 6,572,832, so this integer is abundant. The Collatz stopping time is 58 steps.
Resources
Prime Factor Structure
Factorization String
2^5 × 3 × 7 × 4889
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
9,858,240
Proper Divisor Sum
6,572,832
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#3285407 ← → #3285419
Radix Representation
| Decimal | 3285408 |
| Binary | 1100100010000110100000 (22 bits) |
| Octal | 0o14420640 |
| Hexadecimal | 0x3221A0 |
Divisor Catalog (5 of 48)
Collatz Trajectory (58 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.