9,917,830
2 × 5 × 13 × 23 × 31 × 107
Abundant
Even
Composite
9,917,830 factors as 2 × 5 × 13 × 23 × 31 × 107. Its 64 positive divisors give a proper-divisor sum of 10,984,058, so this integer is abundant. The Collatz stopping time is 145 steps.
Resources
Prime Factor Structure
Factorization String
2 × 5 × 13 × 23 × 31 × 107
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
20,901,888
Proper Divisor Sum
10,984,058
Digit Sum / Digital Root
37 (Root: 1)
Adjacent Primes
#9917827 ← → #9917839
Radix Representation
| Decimal | 9917830 |
| Binary | 100101110101010110000110 (24 bits) |
| Octal | 0o45652606 |
| Hexadecimal | 0x975586 |
Divisor Catalog (5 of 64)
Collatz Trajectory (145 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
Showing the first 5 trajectory entries; the stopping-time total above is unchanged.