4,582,248
23 × 3 × 11 × 17 × 1021
Abundant
Even
Composite
4,582,248 factors as 2^3 × 3 × 11 × 17 × 1021. Its 64 positive divisors give a proper-divisor sum of 8,662,872, so this integer is abundant. The Collatz stopping time is 193 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 11 × 17 × 1021
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
13,245,120
Proper Divisor Sum
8,662,872
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#4582241 ← → #4582271
Radix Representation
| Decimal | 4582248 |
| Binary | 10001011110101101101000 (23 bits) |
| Octal | 0o21365550 |
| Hexadecimal | 0x45EB68 |
Divisor Catalog (5 of 64)
Collatz Trajectory (193 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.