9,797,664
25 × 3 × 102059
Abundant
Even
Composite
9,797,664 factors as 2^5 × 3 × 102059. Its 24 positive divisors give a proper-divisor sum of 15,921,456, so this integer is abundant. The Collatz stopping time is 238 steps.
Resources
Prime Factor Structure
Factorization String
2^5 × 3 × 102059
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
25,719,120
Proper Divisor Sum
15,921,456
Digit Sum / Digital Root
48 (Root: 3)
Adjacent Primes
#9797657 ← → #9797677
Radix Representation
| Decimal | 9797664 |
| Binary | 100101011000000000100000 (24 bits) |
| Octal | 0o45300040 |
| Hexadecimal | 0x958020 |
Divisor Catalog (5 of 24)
Collatz Trajectory (238 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.