7,676,370
2 × 310 × 5 × 13
Abundant
Even
Composite
7,676,370 factors as 2 × 3^10 × 5 × 13. Its 88 positive divisors give a proper-divisor sum of 14,644,026, so this integer is abundant. The Collatz stopping time is 279 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^10 × 5 × 13
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
88
Divisor Sum (σ)
22,320,396
Proper Divisor Sum
14,644,026
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#7676363 ← → #7676371
Radix Representation
| Decimal | 7676370 |
| Binary | 11101010010000111010010 (23 bits) |
| Octal | 0o35220722 |
| Hexadecimal | 0x7521D2 |
Divisor Catalog (5 of 88)
Collatz Trajectory (279 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.