3,962,472
23 × 3 × 165103
Abundant
Even
Composite
3,962,472 factors as 2^3 × 3 × 165103. Its 16 positive divisors give a proper-divisor sum of 5,943,768, so this integer is abundant. The Collatz stopping time is 154 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 165103
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
9,906,240
Proper Divisor Sum
5,943,768
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#3962471 ← → #3962489
Radix Representation
| Decimal | 3962472 |
| Binary | 1111000111011001101000 (22 bits) |
| Octal | 0o17073150 |
| Hexadecimal | 0x3C7668 |
Divisor Catalog (5 of 16)
Collatz Trajectory (154 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.