3,051,540
22 × 33 × 5 × 5651
Abundant
Even
Composite
3,051,540 factors as 2^2 × 3^3 × 5 × 5651. Its 48 positive divisors give a proper-divisor sum of 6,443,820, so this integer is abundant. The Collatz stopping time is 133 steps.
Resources
Prime Factor Structure
Factorization String
2^2 × 3^3 × 5 × 5651
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
9,495,360
Proper Divisor Sum
6,443,820
Digit Sum / Digital Root
18 (Root: 9)
Adjacent Primes
#3051511 ← → #3051553
Radix Representation
| Decimal | 3051540 |
| Binary | 1011101001000000010100 (22 bits) |
| Octal | 0o13510024 |
| Hexadecimal | 0x2E9014 |
Divisor Catalog (5 of 48)
Collatz Trajectory (133 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.