8,170,338
2 × 3 × 11 × 79 × 1567
Abundant
Even
Composite
8,170,338 factors as 2 × 3 × 11 × 79 × 1567. Its 32 positive divisors give a proper-divisor sum of 9,893,022, so this integer is abundant. The Collatz stopping time is 106 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 11 × 79 × 1567
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
18,063,360
Proper Divisor Sum
9,893,022
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#8170307 ← → #8170369
Radix Representation
| Decimal | 8170338 |
| Binary | 11111001010101101100010 (23 bits) |
| Octal | 0o37125542 |
| Hexadecimal | 0x7CAB62 |
Divisor Catalog (5 of 32)
Collatz Trajectory (106 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.