5,969,544
23 × 3 × 7 × 35533
Abundant
Even
Composite
5,969,544 factors as 2^3 × 3 × 7 × 35533. Its 32 positive divisors give a proper-divisor sum of 11,086,776, so this integer is abundant. The Collatz stopping time is 64 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 7 × 35533
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
17,056,320
Proper Divisor Sum
11,086,776
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#5969531 ← → #5969569
Radix Representation
| Decimal | 5969544 |
| Binary | 10110110001011010001000 (23 bits) |
| Octal | 0o26613210 |
| Hexadecimal | 0x5B1688 |
Divisor Catalog (5 of 32)
Collatz Trajectory (64 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.