5,216,328
23 × 32 × 13 × 5573
Abundant
Even
Composite
5,216,328 factors as 2^3 × 3^2 × 13 × 5573. Its 48 positive divisors give a proper-divisor sum of 10,000,692, so this integer is abundant. The Collatz stopping time is 157 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3^2 × 13 × 5573
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
15,217,020
Proper Divisor Sum
10,000,692
Digit Sum / Digital Root
27 (Root: 9)
Adjacent Primes
#5216327 ← → #5216333
Radix Representation
| Decimal | 5216328 |
| Binary | 10011111001100001001000 (23 bits) |
| Octal | 0o23714110 |
| Hexadecimal | 0x4F9848 |
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.