Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,020; 200,000,000,727) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,020 = 22 × 3 × 5 × 47 × 35,461
100,000,020 is not a prime number but a composite one.
200,000,000,727 = 32 × 101 × 11,159 × 19,717
200,000,000,727 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,727 ÷ 100,000,020 = 1,999 + 99,960,747
Step 2. Divide the smaller number by the above operation's remainder:
100,000,020 ÷ 99,960,747 = 1 + 39,273
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,960,747 ÷ 39,273 = 2,545 + 10,962
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
39,273 ÷ 10,962 = 3 + 6,387
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
10,962 ÷ 6,387 = 1 + 4,575
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,387 ÷ 4,575 = 1 + 1,812
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,575 ÷ 1,812 = 2 + 951
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,812 ÷ 951 = 1 + 861
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
951 ÷ 861 = 1 + 90
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
861 ÷ 90 = 9 + 51
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
90 ÷ 51 = 1 + 39
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
51 ÷ 39 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
39 ÷ 12 = 3 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 3 = 4 + 0
At this step, the remainder is zero, so we stop:
3 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,020; 200,000,000,727) = 3
The two numbers have common prime factors