9,437,960
23 × 5 × 7 × 37 × 911
Abundant
Even
Composite
9,437,960 factors as 2^3 × 5 × 7 × 37 × 911. Its 64 positive divisors give a proper-divisor sum of 15,514,360, so this integer is abundant. The Collatz stopping time is 101 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 5 × 7 × 37 × 911
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
24,952,320
Proper Divisor Sum
15,514,360
Digit Sum / Digital Root
38 (Root: 2)
Adjacent Primes
#9437957 ← → #9437969
Radix Representation
| Decimal | 9437960 |
| Binary | 100100000000001100001000 (24 bits) |
| Octal | 0o44001410 |
| Hexadecimal | 0x900308 |
Divisor Catalog (5 of 64)
Collatz Trajectory (101 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.