3,262,050
2 × 32 × 52 × 11 × 659
Abundant
Even
Composite
3,262,050 factors as 2 × 3^2 × 5^2 × 11 × 659. Its 72 positive divisors give a proper-divisor sum of 6,313,230, so this integer is abundant. The Collatz stopping time is 115 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^2 × 5^2 × 11 × 659
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
72
Divisor Sum (σ)
9,575,280
Proper Divisor Sum
6,313,230
Digit Sum / Digital Root
18 (Root: 9)
Adjacent Primes
#3262033 ← → #3262081
Radix Representation
| Decimal | 3262050 |
| Binary | 1100011100011001100010 (22 bits) |
| Octal | 0o14343142 |
| Hexadecimal | 0x31C662 |
Divisor Catalog (5 of 72)
Collatz Trajectory (115 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.