7,752,294
2 × 33 × 11 × 31 × 421
Abundant
Even
Composite
7,752,294 factors as 2 × 3^3 × 11 × 31 × 421. Its 64 positive divisors give a proper-divisor sum of 11,693,466, so this integer is abundant. The Collatz stopping time is 173 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^3 × 11 × 31 × 421
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
19,445,760
Proper Divisor Sum
11,693,466
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#7752293 ← → #7752313
Radix Representation
| Decimal | 7752294 |
| Binary | 11101100100101001100110 (23 bits) |
| Octal | 0o35445146 |
| Hexadecimal | 0x764A66 |
Divisor Catalog (5 of 64)
Collatz Trajectory (173 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.