9,605,586
2 × 3 × 283 × 5657
Abundant
Even
Composite
9,605,586 factors as 2 × 3 × 283 × 5657. Its 16 positive divisors give a proper-divisor sum of 9,676,878, so this integer is abundant. The Collatz stopping time is 238 steps.
Prime Factor Structure
Factorization String
2 × 3 × 283 × 5657
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
19,282,464
Proper Divisor Sum
9,676,878
Digit Sum / Digital Root
39 (Root: 3)
Radix Representation
| Decimal | 9605586 |
| Binary | 100100101001000111010010 (24 bits) |
| Octal | 0o44510722 |
| Hexadecimal | 0x9291D2 |
Divisor Catalog (16)
Collatz Trajectory (238 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
More profiles
Browse other published profiles and their separate link collections.
No other profiles in this collection.