2,104,102
2 × 7 × 11 × 13 × 1051
Abundant
Even
Composite
2,104,102 factors as 2 × 7 × 11 × 13 × 1051. Its 32 positive divisors give a proper-divisor sum of 2,137,562, so this integer is abundant. The Collatz stopping time is 197 steps.
Prime Factor Structure
Factorization String
2 × 7 × 11 × 13 × 1051
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
4,241,664
Proper Divisor Sum
2,137,562
Digit Sum / Digital Root
10 (Root: 1)
Radix Representation
| Decimal | 2104102 |
| Binary | 1000000001101100100110 (22 bits) |
| Octal | 0o10015446 |
| Hexadecimal | 0x201B26 |
Divisor Catalog (32)
Collatz Trajectory (197 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.