5,991,342
2 × 3 × 7 × 29 × 4919
Abundant
Even
Composite
5,991,342 factors as 2 × 3 × 7 × 29 × 4919. Its 32 positive divisors give a proper-divisor sum of 8,178,258, so this integer is abundant. The Collatz stopping time is 227 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 7 × 29 × 4919
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
14,169,600
Proper Divisor Sum
8,178,258
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#5991311 ← → #5991343
Radix Representation
| Decimal | 5991342 |
| Binary | 10110110110101110101110 (23 bits) |
| Octal | 0o26665656 |
| Hexadecimal | 0x5B6BAE |
Divisor Catalog (5 of 32)
Collatz Trajectory (227 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.