7,190,502
2 × 3 × 11 × 108947
Abundant
Even
Composite
7,190,502 factors as 2 × 3 × 11 × 108947. Its 16 positive divisors give a proper-divisor sum of 8,498,010, so this integer is abundant. The Collatz stopping time is 235 steps.
Prime Factor Structure
Factorization String
2 × 3 × 11 × 108947
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
16
Divisor Sum (σ)
15,688,512
Proper Divisor Sum
8,498,010
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#7190489 ← → #7190527
Radix Representation
| Decimal | 7190502 |
| Binary | 11011011011011111100110 (23 bits) |
| Octal | 0o33333746 |
| Hexadecimal | 0x6DB7E6 |
Divisor Catalog (16)
Collatz Trajectory (235 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):