7,016,946
2 × 3 × 1169491
Abundant
Even
Composite
7,016,946 factors as 2 × 3 × 1169491. Its 8 positive divisors give a proper-divisor sum of 7,016,958, so this integer is abundant. The Collatz stopping time is 178 steps.
Prime Factor Structure
Factorization String
2 × 3 × 1169491
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
8
Divisor Sum (σ)
14,033,904
Proper Divisor Sum
7,016,958
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#7016941 ← → #7016963
Radix Representation
| Decimal | 7016946 |
| Binary | 11010110001000111110010 (23 bits) |
| Octal | 0o32610762 |
| Hexadecimal | 0x6B11F2 |
Divisor Catalog (8)
Collatz Trajectory (178 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):