3,932,200
23 × 52 × 19661
Abundant
Even
Composite
3,932,200 factors as 2^3 × 5^2 × 19661. Its 24 positive divisors give a proper-divisor sum of 5,210,630, so this integer is abundant. The Collatz stopping time is 260 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 5^2 × 19661
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
9,142,830
Proper Divisor Sum
5,210,630
Digit Sum / Digital Root
19 (Root: 1)
Adjacent Primes
#3932179 ← → #3932207
Radix Representation
| Decimal | 3932200 |
| Binary | 1111000000000000101000 (22 bits) |
| Octal | 0o17000050 |
| Hexadecimal | 0x3C0028 |
Divisor Catalog (5 of 24)
Collatz Trajectory (260 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.