Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,088; 200,000,000,422) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,088 = 23 × 109 × 114,679
100,000,088 is not a prime number but a composite one.
200,000,000,422 = 2 × 100,000,000,211
200,000,000,422 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,422 ÷ 100,000,088 = 1,999 + 99,824,510
Step 2. Divide the smaller number by the above operation's remainder:
100,000,088 ÷ 99,824,510 = 1 + 175,578
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,824,510 ÷ 175,578 = 568 + 96,206
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
175,578 ÷ 96,206 = 1 + 79,372
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
96,206 ÷ 79,372 = 1 + 16,834
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
79,372 ÷ 16,834 = 4 + 12,036
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
16,834 ÷ 12,036 = 1 + 4,798
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12,036 ÷ 4,798 = 2 + 2,440
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,798 ÷ 2,440 = 1 + 2,358
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,440 ÷ 2,358 = 1 + 82
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,358 ÷ 82 = 28 + 62
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
82 ÷ 62 = 1 + 20
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
62 ÷ 20 = 3 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
20 ÷ 2 = 10 + 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,088; 200,000,000,422) = 2
The two numbers have common prime factors