9,767,970
2 × 32 × 5 × 108533
Abundant
Even
Composite
9,767,970 factors as 2 × 3^2 × 5 × 108533. Its 24 positive divisors give a proper-divisor sum of 15,628,986, so this integer is abundant. The Collatz stopping time is 207 steps.
Prime Factor Structure
Factorization String
2 × 3^2 × 5 × 108533
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
25,396,956
Proper Divisor Sum
15,628,986
Digit Sum / Digital Root
45 (Root: 9)
Radix Representation
| Decimal | 9767970 |
| Binary | 100101010000110000100010 (24 bits) |
| Octal | 0o45206042 |
| Hexadecimal | 0x950C22 |
Divisor Catalog (24)
Collatz Trajectory (207 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.