5,448,608
25 × 11 × 23 × 673
Abundant
Even
Composite
5,448,608 factors as 2^5 × 11 × 23 × 673. Its 48 positive divisors give a proper-divisor sum of 6,780,448, so this integer is abundant. The Collatz stopping time is 157 steps.
Resources
Prime Factor Structure
Factorization String
2^5 × 11 × 23 × 673
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
12,229,056
Proper Divisor Sum
6,780,448
Digit Sum / Digital Root
35 (Root: 8)
Adjacent Primes
#5448589 ← → #5448617
Radix Representation
| Decimal | 5448608 |
| Binary | 10100110010001110100000 (23 bits) |
| Octal | 0o24621640 |
| Hexadecimal | 0x5323A0 |
Divisor Catalog (5 of 48)
Collatz Trajectory (157 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.