Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,176; 200,000,000,342) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,176 = 24 × 3 × 509 × 4,093
100,000,176 is not a prime number but a composite one.
200,000,000,342 = 2 × 100,000,000,171
200,000,000,342 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,342 ÷ 100,000,176 = 1,999 + 99,648,518
Step 2. Divide the smaller number by the above operation's remainder:
100,000,176 ÷ 99,648,518 = 1 + 351,658
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,648,518 ÷ 351,658 = 283 + 129,304
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
351,658 ÷ 129,304 = 2 + 93,050
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
129,304 ÷ 93,050 = 1 + 36,254
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
93,050 ÷ 36,254 = 2 + 20,542
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
36,254 ÷ 20,542 = 1 + 15,712
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
20,542 ÷ 15,712 = 1 + 4,830
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
15,712 ÷ 4,830 = 3 + 1,222
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,830 ÷ 1,222 = 3 + 1,164
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,222 ÷ 1,164 = 1 + 58
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
1,164 ÷ 58 = 20 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
58 ÷ 4 = 14 + 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,176; 200,000,000,342) = 2
The two numbers have common prime factors