10,071,114
2 × 3 × 101 × 16619
Abundant
Even
Composite
10,071,114 factors as 2 × 3 × 101 × 16619. Its 16 positive divisors give a proper-divisor sum of 10,271,766, so this integer is abundant. The Collatz stopping time is 269 steps.
Prime Factor Structure
Factorization String
2 × 3 × 101 × 16619
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
20,342,880
Proper Divisor Sum
10,271,766
Digit Sum / Digital Root
15 (Root: 6)
Radix Representation
| Decimal | 10071114 |
| Binary | 100110011010110001001010 (24 bits) |
| Octal | 0o46326112 |
| Hexadecimal | 0x99AC4A |
Divisor Catalog (16)
Collatz Trajectory (269 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.