9,786,270
2 × 3 × 5 × 13 × 23 × 1091
Abundant
Even
Composite
9,786,270 factors as 2 × 3 × 5 × 13 × 23 × 1091. Its 64 positive divisors give a proper-divisor sum of 16,631,394, so this integer is abundant. The Collatz stopping time is 207 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 13 × 23 × 1091
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
26,417,664
Proper Divisor Sum
16,631,394
Digit Sum / Digital Root
39 (Root: 3)
Adjacent Primes
#9786269 ← → #9786277
Radix Representation
| Decimal | 9786270 |
| Binary | 100101010101001110011110 (24 bits) |
| Octal | 0o45251636 |
| Hexadecimal | 0x95539E |
Divisor Catalog (5 of 64)
Collatz Trajectory (207 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.