2,185,710
2 × 3 × 5 × 41 × 1777
Abundant
Even
Composite
2,185,710 factors as 2 × 3 × 5 × 41 × 1777. Its 32 positive divisors give a proper-divisor sum of 3,190,962, so this integer is abundant. The Collatz stopping time is 86 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 41 × 1777
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
5,376,672
Proper Divisor Sum
3,190,962
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#2185709 ← → #2185723
Radix Representation
| Decimal | 2185710 |
| Binary | 1000010101100111101110 (22 bits) |
| Octal | 0o10254756 |
| Hexadecimal | 0x2159EE |
Divisor Catalog (5 of 32)
Collatz Trajectory (86 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.