Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,286; 2,024,974) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,286 = 2 × 17 × 23 × 7,673
6,000,286 is not a prime number but a composite one.
2,024,974 = 2 × 72 × 20,663
2,024,974 is not a prime number but a composite one.
- Prime number: a natural number that is only divisible by 1 and itself. A prime number has exactly two factors: 1 and itself.
- Composite number: a natural number that has at least one other factor than 1 and itself.
Calculate the greatest (highest) common factor (divisor):
Multiply all the common prime factors, taken by their smallest exponents (the smallest powers).
Step 1. Divide the larger number by the smaller one:
6,000,286 ÷ 2,024,974 = 2 + 1,950,338
Step 2. Divide the smaller number by the above operation's remainder:
2,024,974 ÷ 1,950,338 = 1 + 74,636
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,338 ÷ 74,636 = 26 + 9,802
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,636 ÷ 9,802 = 7 + 6,022
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,802 ÷ 6,022 = 1 + 3,780
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,022 ÷ 3,780 = 1 + 2,242
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,780 ÷ 2,242 = 1 + 1,538
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,242 ÷ 1,538 = 1 + 704
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,538 ÷ 704 = 2 + 130
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
704 ÷ 130 = 5 + 54
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
130 ÷ 54 = 2 + 22
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
54 ÷ 22 = 2 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
22 ÷ 10 = 2 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 2 = 5 + 0
At this step, the remainder is zero, so we stop:
2 is the number we were looking for - the last non-zero remainder.
This is the greatest (highest) common factor (divisor).
The greatest (highest) common factor (divisor):
gcf, hcf, gcd (6,000,286; 2,024,974) = 2
The two numbers have common prime factors