9,703,902
2 × 3 × 13 × 47 × 2647
Abundant
Even
Composite
9,703,902 factors as 2 × 3 × 13 × 47 × 2647. Its 32 positive divisors give a proper-divisor sum of 11,649,570, so this integer is abundant. The Collatz stopping time is 313 steps.
Prime Factor Structure
Factorization String
2 × 3 × 13 × 47 × 2647
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
21,353,472
Proper Divisor Sum
11,649,570
Digit Sum / Digital Root
30 (Root: 3)
Radix Representation
| Decimal | 9703902 |
| Binary | 100101000001000111011110 (24 bits) |
| Octal | 0o45010736 |
| Hexadecimal | 0x9411DE |
Divisor Catalog (32)
Collatz Trajectory (313 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.