9,601,098
2 × 3 × 13 × 123091
Abundant
Even
Composite
9,601,098 factors as 2 × 3 × 13 × 123091. Its 16 positive divisors give a proper-divisor sum of 11,078,358, so this integer is abundant. The Collatz stopping time is 93 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 13 × 123091
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
20,679,456
Proper Divisor Sum
11,078,358
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#9601091 ← → #9601159
Radix Representation
| Decimal | 9601098 |
| Binary | 100100101000000001001010 (24 bits) |
| Octal | 0o44500112 |
| Hexadecimal | 0x92804A |
Divisor Catalog (5 of 16)
Collatz Trajectory (93 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.