2,993,658
2 × 3 × 163 × 3061
Abundant
Even
Composite
2,993,658 factors as 2 × 3 × 163 × 3061. Its 16 positive divisors give a proper-divisor sum of 3,032,358, so this integer is abundant. The Collatz stopping time is 226 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 163 × 3061
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
6,026,016
Proper Divisor Sum
3,032,358
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#2993651 ← → #2993663
Radix Representation
| Decimal | 2993658 |
| Binary | 1011011010110111111010 (22 bits) |
| Octal | 0o13326772 |
| Hexadecimal | 0x2DADFA |
Divisor Catalog (5 of 16)
Collatz Trajectory (226 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.