Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,020; 200,000,000,934) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,020 = 22 × 3 × 5 × 47 × 35,461
100,000,020 is not a prime number but a composite one.
200,000,000,934 = 2 × 34 × 1,234,567,907
200,000,000,934 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:
200,000,000,934 ÷ 100,000,020 = 1,999 + 99,960,954
Step 2. Divide the smaller number by the above operation's remainder:
100,000,020 ÷ 99,960,954 = 1 + 39,066
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,960,954 ÷ 39,066 = 2,558 + 30,126
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
39,066 ÷ 30,126 = 1 + 8,940
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
30,126 ÷ 8,940 = 3 + 3,306
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,940 ÷ 3,306 = 2 + 2,328
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,306 ÷ 2,328 = 1 + 978
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,328 ÷ 978 = 2 + 372
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
978 ÷ 372 = 2 + 234
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
372 ÷ 234 = 1 + 138
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
234 ÷ 138 = 1 + 96
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
138 ÷ 96 = 1 + 42
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
96 ÷ 42 = 2 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
42 ÷ 12 = 3 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 6 = 2 + 0
At this step, the remainder is zero, so we stop:
6 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 (100,000,020; 200,000,000,934) = 6 = 2 × 3
The two numbers have common prime factors