Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (6,000,334; 2,024,948) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
6,000,334 = 2 × 239 × 12,553
6,000,334 is not a prime number but a composite one.
2,024,948 = 22 × 47 × 10,771
2,024,948 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,334 ÷ 2,024,948 = 2 + 1,950,438
Step 2. Divide the smaller number by the above operation's remainder:
2,024,948 ÷ 1,950,438 = 1 + 74,510
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
1,950,438 ÷ 74,510 = 26 + 13,178
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
74,510 ÷ 13,178 = 5 + 8,620
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
13,178 ÷ 8,620 = 1 + 4,558
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,620 ÷ 4,558 = 1 + 4,062
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,558 ÷ 4,062 = 1 + 496
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,062 ÷ 496 = 8 + 94
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
496 ÷ 94 = 5 + 26
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
94 ÷ 26 = 3 + 16
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
26 ÷ 16 = 1 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
16 ÷ 10 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 6 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 4 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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,334; 2,024,948) = 2
The two numbers have common prime factors