Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,034; 200,000,000,688) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,034 = 2 × 50,000,017
100,000,034 is not a prime number but a composite one.
200,000,000,688 = 24 × 3 × 37 × 112,612,613
200,000,000,688 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,688 ÷ 100,000,034 = 1,999 + 99,932,722
Step 2. Divide the smaller number by the above operation's remainder:
100,000,034 ÷ 99,932,722 = 1 + 67,312
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,932,722 ÷ 67,312 = 1,484 + 41,714
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
67,312 ÷ 41,714 = 1 + 25,598
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
41,714 ÷ 25,598 = 1 + 16,116
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
25,598 ÷ 16,116 = 1 + 9,482
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
16,116 ÷ 9,482 = 1 + 6,634
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,482 ÷ 6,634 = 1 + 2,848
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,634 ÷ 2,848 = 2 + 938
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,848 ÷ 938 = 3 + 34
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
938 ÷ 34 = 27 + 20
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
34 ÷ 20 = 1 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
20 ÷ 14 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 6 = 2 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 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,034; 200,000,000,688) = 2
The two numbers have common prime factors