3,256,008
23 × 3 × 7 × 19381
Abundant
Even
Composite
3,256,008 factors as 2^3 × 3 × 7 × 19381. Its 32 positive divisors give a proper-divisor sum of 6,047,352, so this integer is abundant. The Collatz stopping time is 63 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 7 × 19381
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
9,303,360
Proper Divisor Sum
6,047,352
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#3255991 ← → #3256021
Radix Representation
| Decimal | 3256008 |
| Binary | 1100011010111011001000 (22 bits) |
| Octal | 0o14327310 |
| Hexadecimal | 0x31AEC8 |
Divisor Catalog (5 of 32)
Collatz Trajectory (63 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.