Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,674; 2,024,972) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,674 = 2 × 569 × 5,273
6,000,674 is not a prime number but a composite one.
2,024,972 = 22 × 17 × 97 × 307
2,024,972 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,674 ÷ 2,024,972 = 2 + 1,950,730
Step 2. Divide the smaller number by the above operation's remainder:
2,024,972 ÷ 1,950,730 = 1 + 74,242
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,730 ÷ 74,242 = 26 + 20,438
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,242 ÷ 20,438 = 3 + 12,928
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
20,438 ÷ 12,928 = 1 + 7,510
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
12,928 ÷ 7,510 = 1 + 5,418
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,510 ÷ 5,418 = 1 + 2,092
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,418 ÷ 2,092 = 2 + 1,234
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,092 ÷ 1,234 = 1 + 858
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,234 ÷ 858 = 1 + 376
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
858 ÷ 376 = 2 + 106
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
376 ÷ 106 = 3 + 58
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
106 ÷ 58 = 1 + 48
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
58 ÷ 48 = 1 + 10
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
48 ÷ 10 = 4 + 8
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
10 ÷ 8 = 1 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
8 ÷ 2 = 4 + 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,674; 2,024,972) = 2
The two numbers have common prime factors