8,147,238
2 × 3 × 11 × 19 × 73 × 89
Abundant
Even
Composite
8,147,238 factors as 2 × 3 × 11 × 19 × 73 × 89. Its 64 positive divisors give a proper-divisor sum of 11,033,562, so this integer is abundant. The Collatz stopping time is 137 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 11 × 19 × 73 × 89
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
19,180,800
Proper Divisor Sum
11,033,562
Digit Sum / Digital Root
33 (Root: 6)
Adjacent Primes
#8147189 ← → #8147261
Radix Representation
| Decimal | 8147238 |
| Binary | 11111000101000100100110 (23 bits) |
| Octal | 0o37050446 |
| Hexadecimal | 0x7C5126 |
Divisor Catalog (5 of 64)
Collatz Trajectory (137 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.