Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,050; 200,000,000,746) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,050 = 2 × 3 × 52 × 666,667
100,000,050 is not a prime number but a composite one.
200,000,000,746 = 2 × 7 × 13 × 67 × 1,217 × 13,477
200,000,000,746 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,746 ÷ 100,000,050 = 1,999 + 99,900,796
Step 2. Divide the smaller number by the above operation's remainder:
100,000,050 ÷ 99,900,796 = 1 + 99,254
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,900,796 ÷ 99,254 = 1,006 + 51,272
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
99,254 ÷ 51,272 = 1 + 47,982
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
51,272 ÷ 47,982 = 1 + 3,290
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
47,982 ÷ 3,290 = 14 + 1,922
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,290 ÷ 1,922 = 1 + 1,368
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,922 ÷ 1,368 = 1 + 554
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,368 ÷ 554 = 2 + 260
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
554 ÷ 260 = 2 + 34
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
260 ÷ 34 = 7 + 22
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
34 ÷ 22 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
22 ÷ 12 = 1 + 10
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 10 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
10 ÷ 2 = 5 + 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,050; 200,000,000,746) = 2
The two numbers have common prime factors