1,919,106
2 × 33 × 7 × 5077
Abundant
Even
Composite
1,919,106 factors as 2 × 3^3 × 7 × 5077. Its 32 positive divisors give a proper-divisor sum of 2,955,774, so this integer is abundant. The Collatz stopping time is 70 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^3 × 7 × 5077
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
4,874,880
Proper Divisor Sum
2,955,774
Digit Sum / Digital Root
27 (Root: 9)
Adjacent Primes
#1919063 ← → #1919119
Radix Representation
| Decimal | 1919106 |
| Binary | 111010100100010000010 (21 bits) |
| Octal | 0o7244202 |
| Hexadecimal | 0x1D4882 |
Divisor Catalog (5 of 32)
Collatz Trajectory (70 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
Showing the first 5 trajectory entries; the stopping-time total above is unchanged.