Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,126; 200,000,000,236) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,126 = 2 × 50,000,063
100,000,126 is not a prime number but a composite one.
200,000,000,236 = 22 × 50,000,000,059
200,000,000,236 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,236 ÷ 100,000,126 = 1,999 + 99,748,362
Step 2. Divide the smaller number by the above operation's remainder:
100,000,126 ÷ 99,748,362 = 1 + 251,764
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,748,362 ÷ 251,764 = 396 + 49,818
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
251,764 ÷ 49,818 = 5 + 2,674
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
49,818 ÷ 2,674 = 18 + 1,686
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
2,674 ÷ 1,686 = 1 + 988
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,686 ÷ 988 = 1 + 698
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
988 ÷ 698 = 1 + 290
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
698 ÷ 290 = 2 + 118
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
290 ÷ 118 = 2 + 54
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
118 ÷ 54 = 2 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
54 ÷ 10 = 5 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 4 = 2 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,126; 200,000,000,236) = 2
The two numbers have common prime factors