5,995,212
22 × 3 × 499601
Abundant
Even
Composite
5,995,212 factors as 2^2 × 3 × 499601. Its 12 positive divisors give a proper-divisor sum of 7,993,644, so this integer is abundant. The Collatz stopping time is 113 steps.
Resources
Prime Factor Structure
Factorization String
2^2 × 3 × 499601
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
12
Divisor Sum (σ)
13,988,856
Proper Divisor Sum
7,993,644
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#5995211 ← → #5995217
Radix Representation
| Decimal | 5995212 |
| Binary | 10110110111101011001100 (23 bits) |
| Octal | 0o26675314 |
| Hexadecimal | 0x5B7ACC |
Divisor Catalog (5 of 12)
Collatz Trajectory (113 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.