9,957,690
2 × 32 × 5 × 110641
Abundant
Even
Composite
9,957,690 factors as 2 × 3^2 × 5 × 110641. Its 24 positive divisors give a proper-divisor sum of 15,932,538, so this integer is abundant. The Collatz stopping time is 114 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^2 × 5 × 110641
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
25,890,228
Proper Divisor Sum
15,932,538
Digit Sum / Digital Root
45 (Root: 9)
Adjacent Primes
#9957683 ← → #9957697
Radix Representation
| Decimal | 9957690 |
| Binary | 100101111111000100111010 (24 bits) |
| Octal | 0o45770472 |
| Hexadecimal | 0x97F13A |
Divisor Catalog (5 of 24)
Collatz Trajectory (114 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.