6,643,914

2 × 3 × 1107319

6,643,914 factors as 2 × 3 × 1107319. Its 8 positive divisors give a proper-divisor sum of 6,643,926, so this integer is abundant. The Collatz stopping time is 178 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1107319

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,287,840

Proper Divisor Sum 6,643,926

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6643909 ← → #6643919

Radix Representation

Decimal	6643914
Binary	11001010110000011001010 (23 bits)
Octal	0o31260312
Hexadecimal	0x6560CA

Divisor Catalog (8)

1 2 3 6 1,107,319 2,214,638 3,321,957 6,643,914

Collatz Trajectory (178 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

6,643,914 3,321,957 9,965,872 4,982,936 2,491,468 1,245,734 622,867 1,868,602 934,301 2,802,904 1,401,452 700,726 350,363 1,051,090 525,545 1,576,636 788,318 394,159 1,182,478 591,239 1,773,718 886,859 2,660,578 1,330,289 3,990,868 1,995,434 997,717 2,993,152 1,496,576 748,288 374,144 187,072 93,536 46,768 23,384 11,692 5,846 2,923 8,770 4,385 13,156 6,578 3,289 9,868 4,934 2,467 7,402 3,701 11,104 5,552 2,776 1,388 694 347 1,042 521 1,564 782 391 1,174

← Previous Integer #6,643,913 Browse Full Index Next Integer #6,643,915 →