Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,010; 200,000,000,224) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,010 = 2 × 5 × 11 × 909,091
100,000,010 is not a prime number but a composite one.
200,000,000,224 = 25 × 61,099 × 102,293
200,000,000,224 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,224 ÷ 100,000,010 = 1,999 + 99,980,234
Step 2. Divide the smaller number by the above operation's remainder:
100,000,010 ÷ 99,980,234 = 1 + 19,776
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,980,234 ÷ 19,776 = 5,055 + 12,554
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
19,776 ÷ 12,554 = 1 + 7,222
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
12,554 ÷ 7,222 = 1 + 5,332
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,222 ÷ 5,332 = 1 + 1,890
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,332 ÷ 1,890 = 2 + 1,552
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,890 ÷ 1,552 = 1 + 338
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,552 ÷ 338 = 4 + 200
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
338 ÷ 200 = 1 + 138
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
200 ÷ 138 = 1 + 62
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
138 ÷ 62 = 2 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
62 ÷ 14 = 4 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 6 = 2 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,010; 200,000,000,224) = 2
The two numbers have common prime factors