Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,102; 200,000,000,352) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,102 = 2 × 6,367 × 7,853
100,000,102 is not a prime number but a composite one.
200,000,000,352 = 25 × 3 × 19 × 109,649,123
200,000,000,352 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,352 ÷ 100,000,102 = 1,999 + 99,796,454
Step 2. Divide the smaller number by the above operation's remainder:
100,000,102 ÷ 99,796,454 = 1 + 203,648
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,796,454 ÷ 203,648 = 490 + 8,934
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
203,648 ÷ 8,934 = 22 + 7,100
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
8,934 ÷ 7,100 = 1 + 1,834
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,100 ÷ 1,834 = 3 + 1,598
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,834 ÷ 1,598 = 1 + 236
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,598 ÷ 236 = 6 + 182
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
236 ÷ 182 = 1 + 54
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
182 ÷ 54 = 3 + 20
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
54 ÷ 20 = 2 + 14
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
20 ÷ 14 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
14 ÷ 6 = 2 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,102; 200,000,000,352) = 2
The two numbers have common prime factors