8,928,744
23 × 3 × 11 × 31 × 1091
Abundant
Even
Composite
8,928,744 factors as 2^3 × 3 × 11 × 31 × 1091. Its 64 positive divisors give a proper-divisor sum of 16,230,936, so this integer is abundant. The Collatz stopping time is 318 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 11 × 31 × 1091
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
25,159,680
Proper Divisor Sum
16,230,936
Digit Sum / Digital Root
42 (Root: 6)
Adjacent Primes
#8928721 ← → #8928749
Radix Representation
| Decimal | 8928744 |
| Binary | 100010000011110111101000 (24 bits) |
| Octal | 0o42036750 |
| Hexadecimal | 0x883DE8 |
Divisor Catalog (5 of 64)
Collatz Trajectory (318 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.