9,605,328
24 × 3 × 97 × 2063
Abundant
Even
Composite
9,605,328 factors as 2^4 × 3 × 97 × 2063. Its 40 positive divisors give a proper-divisor sum of 15,476,400, so this integer is abundant. The Collatz stopping time is 70 steps.
Prime Factor Structure
Factorization String
2^4 × 3 × 97 × 2063
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
25,081,728
Proper Divisor Sum
15,476,400
Digit Sum / Digital Root
33 (Root: 6)
Radix Representation
| Decimal | 9605328 |
| Binary | 100100101001000011010000 (24 bits) |
| Octal | 0o44510320 |
| Hexadecimal | 0x9290D0 |
Divisor Catalog (40)
Collatz Trajectory (70 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.