9,883,510
2 × 5 × 7 × 13 × 10861
Abundant
Even
Composite
9,883,510 factors as 2 × 5 × 7 × 13 × 10861. Its 32 positive divisors give a proper-divisor sum of 12,014,282, so this integer is abundant. The Collatz stopping time is 313 steps.
Prime Factor Structure
Factorization String
2 × 5 × 7 × 13 × 10861
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
21,897,792
Proper Divisor Sum
12,014,282
Digit Sum / Digital Root
34 (Root: 7)
Radix Representation
| Decimal | 9883510 |
| Binary | 100101101100111101110110 (24 bits) |
| Octal | 0o45547566 |
| Hexadecimal | 0x96CF76 |
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.