1,879,302
2 × 3 × 293 × 1069
Abundant
Even
Composite
1,879,302 factors as 2 × 3 × 293 × 1069. Its 16 positive divisors give a proper-divisor sum of 1,895,658, so this integer is abundant. The Collatz stopping time is 202 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 293 × 1069
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
3,774,960
Proper Divisor Sum
1,895,658
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#1879301 ← → #1879351
Radix Representation
| Decimal | 1879302 |
| Binary | 111001010110100000110 (21 bits) |
| Octal | 0o7126406 |
| Hexadecimal | 0x1CAD06 |
Divisor Catalog (5 of 16)
Collatz Trajectory (202 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.