2,507,694
2 × 3 × 7 × 59707
Abundant
Even
Composite
2,507,694 factors as 2 × 3 × 7 × 59707. Its 16 positive divisors give a proper-divisor sum of 3,224,274, so this integer is abundant. The Collatz stopping time is 174 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 7 × 59707
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
5,731,968
Proper Divisor Sum
3,224,274
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#2507693 ← → #2507707
Radix Representation
| Decimal | 2507694 |
| Binary | 1001100100001110101110 (22 bits) |
| Octal | 0o11441656 |
| Hexadecimal | 0x2643AE |
Divisor Catalog (5 of 16)
Collatz Trajectory (174 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.