Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,089; 200,000,000,326) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,089 = 35 × 7 × 58,789
100,000,089 is not a prime number but a composite one.
200,000,000,326 = 2 × 7 × 59 × 257 × 942,143
200,000,000,326 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,326 ÷ 100,000,089 = 1,999 + 99,822,415
Step 2. Divide the smaller number by the above operation's remainder:
100,000,089 ÷ 99,822,415 = 1 + 177,674
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,822,415 ÷ 177,674 = 561 + 147,301
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
177,674 ÷ 147,301 = 1 + 30,373
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
147,301 ÷ 30,373 = 4 + 25,809
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
30,373 ÷ 25,809 = 1 + 4,564
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
25,809 ÷ 4,564 = 5 + 2,989
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,564 ÷ 2,989 = 1 + 1,575
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,989 ÷ 1,575 = 1 + 1,414
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,575 ÷ 1,414 = 1 + 161
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,414 ÷ 161 = 8 + 126
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
161 ÷ 126 = 1 + 35
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
126 ÷ 35 = 3 + 21
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
35 ÷ 21 = 1 + 14
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
21 ÷ 14 = 1 + 7
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
14 ÷ 7 = 2 + 0
At this step, the remainder is zero, so we stop:
7 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,089; 200,000,000,326) = 7
The two numbers have common prime factors