3,319,656
23 × 3 × 138319
Abundant
Even
Composite
3,319,656 factors as 2^3 × 3 × 138319. Its 16 positive divisors give a proper-divisor sum of 4,979,544, so this integer is abundant. The Collatz stopping time is 177 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 138319
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
8,299,200
Proper Divisor Sum
4,979,544
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#3319639 ← → #3319703
Radix Representation
| Decimal | 3319656 |
| Binary | 1100101010011101101000 (22 bits) |
| Octal | 0o14523550 |
| Hexadecimal | 0x32A768 |
Divisor Catalog (5 of 16)
Collatz Trajectory (177 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.