1,811,454
2 × 3 × 31 × 9739
Abundant
Even
Composite
1,811,454 factors as 2 × 3 × 31 × 9739. Its 16 positive divisors give a proper-divisor sum of 1,928,706, so this integer is abundant. The Collatz stopping time is 233 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 31 × 9739
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
3,740,160
Proper Divisor Sum
1,928,706
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#1811443 ← → #1811473
Radix Representation
| Decimal | 1811454 |
| Binary | 110111010001111111110 (21 bits) |
| Octal | 0o6721776 |
| Hexadecimal | 0x1BA3FE |
Divisor Catalog (5 of 16)
Collatz Trajectory (233 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.