Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,152; 200,000,000,566) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,152 = 23 × 32 × 7 × 198,413
100,000,152 is not a prime number but a composite one.
200,000,000,566 = 2 × 100,000,000,283
200,000,000,566 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,566 ÷ 100,000,152 = 1,999 + 99,696,718
Step 2. Divide the smaller number by the above operation's remainder:
100,000,152 ÷ 99,696,718 = 1 + 303,434
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,696,718 ÷ 303,434 = 328 + 170,366
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
303,434 ÷ 170,366 = 1 + 133,068
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
170,366 ÷ 133,068 = 1 + 37,298
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
133,068 ÷ 37,298 = 3 + 21,174
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
37,298 ÷ 21,174 = 1 + 16,124
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
21,174 ÷ 16,124 = 1 + 5,050
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
16,124 ÷ 5,050 = 3 + 974
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
5,050 ÷ 974 = 5 + 180
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
974 ÷ 180 = 5 + 74
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
180 ÷ 74 = 2 + 32
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
74 ÷ 32 = 2 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
32 ÷ 10 = 3 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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 (100,000,152; 200,000,000,566) = 2
The two numbers have common prime factors