Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,042; 200,000,000,694) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,042 = 2 × 50,000,021
100,000,042 is not a prime number but a composite one.
200,000,000,694 = 2 × 3 × 13 × 19 × 313 × 359 × 1,201
200,000,000,694 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,694 ÷ 100,000,042 = 1,999 + 99,916,736
Step 2. Divide the smaller number by the above operation's remainder:
100,000,042 ÷ 99,916,736 = 1 + 83,306
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,916,736 ÷ 83,306 = 1,199 + 32,842
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
83,306 ÷ 32,842 = 2 + 17,622
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
32,842 ÷ 17,622 = 1 + 15,220
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
17,622 ÷ 15,220 = 1 + 2,402
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
15,220 ÷ 2,402 = 6 + 808
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,402 ÷ 808 = 2 + 786
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
808 ÷ 786 = 1 + 22
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
786 ÷ 22 = 35 + 16
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
22 ÷ 16 = 1 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
16 ÷ 6 = 2 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
6 ÷ 4 = 1 + 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,042; 200,000,000,694) = 2
The two numbers have common prime factors