Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,042; 200,000,000,356) = ?
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,356 = 22 × 13 × 3,846,153,853
200,000,000,356 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,356 ÷ 100,000,042 = 1,999 + 99,916,398
Step 2. Divide the smaller number by the above operation's remainder:
100,000,042 ÷ 99,916,398 = 1 + 83,644
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,916,398 ÷ 83,644 = 1,194 + 45,462
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
83,644 ÷ 45,462 = 1 + 38,182
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
45,462 ÷ 38,182 = 1 + 7,280
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
38,182 ÷ 7,280 = 5 + 1,782
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,280 ÷ 1,782 = 4 + 152
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,782 ÷ 152 = 11 + 110
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
152 ÷ 110 = 1 + 42
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
110 ÷ 42 = 2 + 26
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
42 ÷ 26 = 1 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
26 ÷ 16 = 1 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 10 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 6 = 1 + 4
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 4 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
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,356) = 2
The two numbers have common prime factors