6,519,216
24 × 3 × 11 × 12347
Abundant
Even
Composite
6,519,216 factors as 2^4 × 3 × 11 × 12347. Its 40 positive divisors give a proper-divisor sum of 11,854,608, so this integer is abundant. The Collatz stopping time is 116 steps.
Resources
Prime Factor Structure
Factorization String
2^4 × 3 × 11 × 12347
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
18,373,824
Proper Divisor Sum
11,854,608
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#6519209 ← → #6519217
Radix Representation
| Decimal | 6519216 |
| Binary | 11000110111100110110000 (23 bits) |
| Octal | 0o30674660 |
| Hexadecimal | 0x6379B0 |
Divisor Catalog (5 of 40)
Collatz Trajectory (116 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.