Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,054; 200,000,000,206) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,054 = 2 × 7 × 11 × 127 × 5,113
100,000,054 is not a prime number but a composite one.
200,000,000,206 = 2 × 100,000,000,103
200,000,000,206 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,206 ÷ 100,000,054 = 1,999 + 99,892,260
Step 2. Divide the smaller number by the above operation's remainder:
100,000,054 ÷ 99,892,260 = 1 + 107,794
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,892,260 ÷ 107,794 = 926 + 75,016
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
107,794 ÷ 75,016 = 1 + 32,778
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
75,016 ÷ 32,778 = 2 + 9,460
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
32,778 ÷ 9,460 = 3 + 4,398
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,460 ÷ 4,398 = 2 + 664
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,398 ÷ 664 = 6 + 414
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
664 ÷ 414 = 1 + 250
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
414 ÷ 250 = 1 + 164
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
250 ÷ 164 = 1 + 86
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
164 ÷ 86 = 1 + 78
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
86 ÷ 78 = 1 + 8
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
78 ÷ 8 = 9 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
8 ÷ 6 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 2 = 3 + 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,054; 200,000,000,206) = 2
The two numbers have common prime factors