9,708,150
2 × 3 × 52 × 61 × 1061
Abundant
Even
Composite
9,708,150 factors as 2 × 3 × 5^2 × 61 × 1061. Its 48 positive divisors give a proper-divisor sum of 14,785,818, so this integer is abundant. The Collatz stopping time is 269 steps.
Prime Factor Structure
Factorization String
2 × 3 × 5^2 × 61 × 1061
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
24,493,968
Proper Divisor Sum
14,785,818
Digit Sum / Digital Root
30 (Root: 3)
Radix Representation
| Decimal | 9708150 |
| Binary | 100101000010001001110110 (24 bits) |
| Octal | 0o45021166 |
| Hexadecimal | 0x942276 |
Divisor Catalog (48)
Collatz Trajectory (269 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.