9,732,678
2 × 3 × 421 × 3853
Abundant
Even
Composite
9,732,678 factors as 2 × 3 × 421 × 3853. Its 16 positive divisors give a proper-divisor sum of 9,783,978, so this integer is abundant. The Collatz stopping time is 145 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 421 × 3853
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
19,516,656
Proper Divisor Sum
9,783,978
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#9732677 ← → #9732691
Radix Representation
| Decimal | 9732678 |
| Binary | 100101001000001001000110 (24 bits) |
| Octal | 0o45101106 |
| Hexadecimal | 0x948246 |
Divisor Catalog (5 of 16)
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.