9,604,936
23 × 11 × 109147
Abundant
Even
Composite
9,604,936 factors as 2^3 × 11 × 109147. Its 16 positive divisors give a proper-divisor sum of 10,041,704, so this integer is abundant. The Collatz stopping time is 194 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 11 × 109147
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
19,646,640
Proper Divisor Sum
10,041,704
Digit Sum / Digital Root
37 (Root: 1)
Adjacent Primes
#9604913 ← → #9604939
Radix Representation
| Decimal | 9604936 |
| Binary | 100100101000111101001000 (24 bits) |
| Octal | 0o44507510 |
| Hexadecimal | 0x928F48 |
Divisor Catalog (5 of 16)
Collatz Trajectory (194 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.