9,186,294
2 × 3 × 13 × 117773
Abundant
Even
Composite
9,186,294 factors as 2 × 3 × 13 × 117773. Its 16 positive divisors give a proper-divisor sum of 10,599,738, so this integer is abundant. The Collatz stopping time is 119 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 13 × 117773
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
19,786,032
Proper Divisor Sum
10,599,738
Digit Sum / Digital Root
39 (Root: 3)
Adjacent Primes
#9186277 ← → #9186299
Radix Representation
| Decimal | 9186294 |
| Binary | 100011000010101111110110 (24 bits) |
| Octal | 0o43025766 |
| Hexadecimal | 0x8C2BF6 |
Divisor Catalog (5 of 16)
Collatz Trajectory (119 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.