5,888,874
2 × 3 × 23 × 139 × 307
Abundant
Even
Composite
5,888,874 factors as 2 × 3 × 23 × 139 × 307. Its 32 positive divisors give a proper-divisor sum of 6,529,686, so this integer is abundant. The Collatz stopping time is 152 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 23 × 139 × 307
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
12,418,560
Proper Divisor Sum
6,529,686
Digit Sum / Digital Root
48 (Root: 3)
Adjacent Primes
#5888873 ← → #5888881
Radix Representation
| Decimal | 5888874 |
| Binary | 10110011101101101101010 (23 bits) |
| Octal | 0o26355552 |
| Hexadecimal | 0x59DB6A |
Divisor Catalog (5 of 32)
Collatz Trajectory (152 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.