9,902,190
2 × 3 × 5 × 23 × 113 × 127
Abundant
Even
Composite
9,902,190 factors as 2 × 3 × 5 × 23 × 113 × 127. Its 64 positive divisors give a proper-divisor sum of 15,312,786, so this integer is abundant. The Collatz stopping time is 145 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 23 × 113 × 127
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
25,214,976
Proper Divisor Sum
15,312,786
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#9902183 ← → #9902203
Radix Representation
| Decimal | 9902190 |
| Binary | 100101110001100001101110 (24 bits) |
| Octal | 0o45614156 |
| Hexadecimal | 0x97186E |
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.