9,907,194
2 × 3 × 11 × 37 × 4057
Abundant
Even
Composite
9,907,194 factors as 2 × 3 × 11 × 37 × 4057. Its 32 positive divisors give a proper-divisor sum of 12,298,182, so this integer is abundant. The Collatz stopping time is 313 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 11 × 37 × 4057
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
22,205,376
Proper Divisor Sum
12,298,182
Digit Sum / Digital Root
39 (Root: 3)
Adjacent Primes
#9907187 ← → #9907211
Radix Representation
| Decimal | 9907194 |
| Binary | 100101110010101111111010 (24 bits) |
| Octal | 0o45625772 |
| Hexadecimal | 0x972BFA |
Divisor Catalog (5 of 32)
Collatz Trajectory (313 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.