9,143,130
2 × 3 × 5 × 304771
Abundant
Even
Composite
9,143,130 factors as 2 × 3 × 5 × 304771. Its 16 positive divisors give a proper-divisor sum of 12,800,454, so this integer is abundant. The Collatz stopping time is 194 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 304771
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
21,943,584
Proper Divisor Sum
12,800,454
Digit Sum / Digital Root
21 (Root: 3)
Adjacent Primes
#9143119 ← → #9143137
Radix Representation
| Decimal | 9143130 |
| Binary | 100010111000001101011010 (24 bits) |
| Octal | 0o42701532 |
| Hexadecimal | 0x8B835A |
Divisor Catalog (5 of 16)
Collatz Trajectory (194 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.