Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,119; 200,000,001,372) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,119 = 3 × 33,333,373
100,000,119 is not a prime number but a composite one.
200,000,001,372 = 22 × 3 × 16,666,666,781
200,000,001,372 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,001,372 ÷ 100,000,119 = 1,999 + 99,763,491
Step 2. Divide the smaller number by the above operation's remainder:
100,000,119 ÷ 99,763,491 = 1 + 236,628
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,763,491 ÷ 236,628 = 421 + 143,103
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
236,628 ÷ 143,103 = 1 + 93,525
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
143,103 ÷ 93,525 = 1 + 49,578
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
93,525 ÷ 49,578 = 1 + 43,947
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
49,578 ÷ 43,947 = 1 + 5,631
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
43,947 ÷ 5,631 = 7 + 4,530
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,631 ÷ 4,530 = 1 + 1,101
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,530 ÷ 1,101 = 4 + 126
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,101 ÷ 126 = 8 + 93
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
126 ÷ 93 = 1 + 33
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
93 ÷ 33 = 2 + 27
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
33 ÷ 27 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
27 ÷ 6 = 4 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,119; 200,000,001,372) = 3
The two numbers have common prime factors