Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,130; 200,000,000,332) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,130 = 2 × 5 × 421 × 23,753
100,000,130 is not a prime number but a composite one.
200,000,000,332 = 22 × 11 × 47 × 96,711,799
200,000,000,332 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,332 ÷ 100,000,130 = 1,999 + 99,740,462
Step 2. Divide the smaller number by the above operation's remainder:
100,000,130 ÷ 99,740,462 = 1 + 259,668
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,740,462 ÷ 259,668 = 384 + 27,950
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
259,668 ÷ 27,950 = 9 + 8,118
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
27,950 ÷ 8,118 = 3 + 3,596
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,118 ÷ 3,596 = 2 + 926
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,596 ÷ 926 = 3 + 818
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
926 ÷ 818 = 1 + 108
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
818 ÷ 108 = 7 + 62
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
108 ÷ 62 = 1 + 46
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
62 ÷ 46 = 1 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
46 ÷ 16 = 2 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 14 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 2 = 7 + 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,130; 200,000,000,332) = 2
The two numbers have common prime factors