Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,072; 200,000,000,202) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,072 = 23 × 73 × 171,233
100,000,072 is not a prime number but a composite one.
200,000,000,202 = 2 × 3 × 389 × 85,689,803
200,000,000,202 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,202 ÷ 100,000,072 = 1,999 + 99,856,274
Step 2. Divide the smaller number by the above operation's remainder:
100,000,072 ÷ 99,856,274 = 1 + 143,798
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,856,274 ÷ 143,798 = 694 + 60,462
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
143,798 ÷ 60,462 = 2 + 22,874
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
60,462 ÷ 22,874 = 2 + 14,714
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
22,874 ÷ 14,714 = 1 + 8,160
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,714 ÷ 8,160 = 1 + 6,554
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,160 ÷ 6,554 = 1 + 1,606
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,554 ÷ 1,606 = 4 + 130
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,606 ÷ 130 = 12 + 46
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
130 ÷ 46 = 2 + 38
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
46 ÷ 38 = 1 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
38 ÷ 8 = 4 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 6 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 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 (100,000,072; 200,000,000,202) = 2
The two numbers have common prime factors