9,844,482
2 × 3 × 1021 × 1607
Abundant
Even
Composite
9,844,482 factors as 2 × 3 × 1021 × 1607. Its 16 positive divisors give a proper-divisor sum of 9,876,030, so this integer is abundant. The Collatz stopping time is 176 steps.
Prime Factor Structure
Factorization String
2 × 3 × 1021 × 1607
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
19,720,512
Proper Divisor Sum
9,876,030
Digit Sum / Digital Root
39 (Root: 3)
Radix Representation
| Decimal | 9844482 |
| Binary | 100101100011011100000010 (24 bits) |
| Octal | 0o45433402 |
| Hexadecimal | 0x963702 |
Divisor Catalog (16)
Collatz Trajectory (176 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
More profiles
Browse other published profiles and their separate link collections.
No other profiles in this collection.