7,149,870
2 × 34 × 5 × 7 × 13 × 97
Abundant
Even
Composite
7,149,870 factors as 2 × 3^4 × 5 × 7 × 13 × 97. Its 160 positive divisors give a proper-divisor sum of 16,755,858, so this integer is abundant. The Collatz stopping time is 98 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^4 × 5 × 7 × 13 × 97
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
160
Divisor Sum (σ)
23,905,728
Proper Divisor Sum
16,755,858
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#7149851 ← → #7149899
Radix Representation
| Decimal | 7149870 |
| Binary | 11011010001100100101110 (23 bits) |
| Octal | 0o33214456 |
| Hexadecimal | 0x6D192E |
Divisor Catalog (5 of 160)
Collatz Trajectory (98 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.