9,709,974
2 × 32 × 257 × 2099
Abundant
Even
Composite
9,709,974 factors as 2 × 3^2 × 257 × 2099. Its 24 positive divisors give a proper-divisor sum of 11,420,226, so this integer is abundant. The Collatz stopping time is 238 steps.
Prime Factor Structure
Factorization String
2 × 3^2 × 257 × 2099
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
21,130,200
Proper Divisor Sum
11,420,226
Digit Sum / Digital Root
45 (Root: 9)
Radix Representation
| Decimal | 9709974 |
| Binary | 100101000010100110010110 (24 bits) |
| Octal | 0o45024626 |
| Hexadecimal | 0x942996 |
Divisor Catalog (24)
Collatz Trajectory (238 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.