3,009,440
25 × 5 × 7 × 2687
Abundant
Even
Composite
3,009,440 factors as 2^5 × 5 × 7 × 2687. Its 48 positive divisors give a proper-divisor sum of 5,119,072, so this integer is abundant. The Collatz stopping time is 164 steps.
Resources
Prime Factor Structure
Factorization String
2^5 × 5 × 7 × 2687
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
8,128,512
Proper Divisor Sum
5,119,072
Digit Sum / Digital Root
20 (Root: 2)
Adjacent Primes
#3009437 ← → #3009443
Radix Representation
| Decimal | 3009440 |
| Binary | 1011011110101110100000 (22 bits) |
| Octal | 0o13365640 |
| Hexadecimal | 0x2DEBA0 |
Divisor Catalog (5 of 48)
Collatz Trajectory (164 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.