3,866,058
2 × 32 × 7 × 61 × 503
Abundant
Even
Composite
3,866,058 factors as 2 × 3^2 × 7 × 61 × 503. Its 48 positive divisors give a proper-divisor sum of 5,883,318, so this integer is abundant. The Collatz stopping time is 216 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^2 × 7 × 61 × 503
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
9,749,376
Proper Divisor Sum
5,883,318
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#3866039 ← → #3866081
Radix Representation
| Decimal | 3866058 |
| Binary | 1110101111110111001010 (22 bits) |
| Octal | 0o16576712 |
| Hexadecimal | 0x3AFDCA |
Divisor Catalog (5 of 48)
Collatz Trajectory (216 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.