Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,142; 200,000,000,502) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,142 = 2 × 11 × 4,545,461
100,000,142 is not a prime number but a composite one.
200,000,000,502 = 2 × 33 × 1,301 × 2,846,813
200,000,000,502 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,502 ÷ 100,000,142 = 1,999 + 99,716,644
Step 2. Divide the smaller number by the above operation's remainder:
100,000,142 ÷ 99,716,644 = 1 + 283,498
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,716,644 ÷ 283,498 = 351 + 208,846
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
283,498 ÷ 208,846 = 1 + 74,652
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
208,846 ÷ 74,652 = 2 + 59,542
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
74,652 ÷ 59,542 = 1 + 15,110
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
59,542 ÷ 15,110 = 3 + 14,212
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
15,110 ÷ 14,212 = 1 + 898
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
14,212 ÷ 898 = 15 + 742
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
898 ÷ 742 = 1 + 156
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
742 ÷ 156 = 4 + 118
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
156 ÷ 118 = 1 + 38
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
118 ÷ 38 = 3 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
38 ÷ 4 = 9 + 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 (100,000,142; 200,000,000,502) = 2
The two numbers have common prime factors