3,978,726
2 × 3 × 31 × 21391
Abundant
Even
Composite
3,978,726 factors as 2 × 3 × 31 × 21391. Its 16 positive divisors give a proper-divisor sum of 4,235,802, so this integer is abundant. The Collatz stopping time is 260 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 31 × 21391
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
8,214,528
Proper Divisor Sum
4,235,802
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#3978707 ← → #3978727
Radix Representation
| Decimal | 3978726 |
| Binary | 1111001011010111100110 (22 bits) |
| Octal | 0o17132746 |
| Hexadecimal | 0x3CB5E6 |
Divisor Catalog (5 of 16)
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.