2,650,710
2 × 3 × 5 × 149 × 593
Abundant
Even
Composite
2,650,710 factors as 2 × 3 × 5 × 149 × 593. Its 32 positive divisors give a proper-divisor sum of 3,764,490, so this integer is abundant. The Collatz stopping time is 125 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 149 × 593
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
6,415,200
Proper Divisor Sum
3,764,490
Digit Sum / Digital Root
21 (Root: 3)
Adjacent Primes
#2650699 ← → #2650751
Radix Representation
| Decimal | 2650710 |
| Binary | 1010000111001001010110 (22 bits) |
| Octal | 0o12071126 |
| Hexadecimal | 0x287256 |
Divisor Catalog (5 of 32)
Collatz Trajectory (125 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.