7,250,094
2 × 33 × 31 × 61 × 71
Abundant
Even
Composite
7,250,094 factors as 2 × 3^3 × 31 × 61 × 71. Its 64 positive divisors give a proper-divisor sum of 9,891,666, so this integer is abundant. The Collatz stopping time is 328 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^3 × 31 × 61 × 71
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
17,141,760
Proper Divisor Sum
9,891,666
Digit Sum / Digital Root
27 (Root: 9)
Adjacent Primes
#7250069 ← → #7250099
Radix Representation
| Decimal | 7250094 |
| Binary | 11011101010000010101110 (23 bits) |
| Octal | 0o33520256 |
| Hexadecimal | 0x6EA0AE |
Divisor Catalog (5 of 64)
Collatz Trajectory (328 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.