6,058,248
23 × 3 × 7 × 36061
Abundant
Even
Composite
6,058,248 factors as 2^3 × 3 × 7 × 36061. Its 32 positive divisors give a proper-divisor sum of 11,251,512, so this integer is abundant. The Collatz stopping time is 183 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 7 × 36061
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
17,309,760
Proper Divisor Sum
11,251,512
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#6058243 ← → #6058289
Radix Representation
| Decimal | 6058248 |
| Binary | 10111000111000100001000 (23 bits) |
| Octal | 0o27070410 |
| Hexadecimal | 0x5C7108 |
Divisor Catalog (5 of 32)
Collatz Trajectory (183 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.