9,706,410
2 × 32 × 5 × 72 × 31 × 71
Abundant
Even
Composite
9,706,410 factors as 2 × 3^2 × 5 × 7^2 × 31 × 71. Its 144 positive divisors give a proper-divisor sum of 21,024,342, so this integer is abundant. The Collatz stopping time is 114 steps.
Prime Factor Structure
Factorization String
2 × 3^2 × 5 × 7^2 × 31 × 71
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
144
Divisor Sum (σ)
30,730,752
Proper Divisor Sum
21,024,342
Digit Sum / Digital Root
27 (Root: 9)
Radix Representation
| Decimal | 9706410 |
| Binary | 100101000001101110101010 (24 bits) |
| Octal | 0o45015652 |
| Hexadecimal | 0x941BAA |
Divisor Catalog (60 of 144)
Collatz Trajectory (114 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.