Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,056; 200,000,000,550) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,056 = 23 × 3 × 13 × 320,513
100,000,056 is not a prime number but a composite one.
200,000,000,550 = 2 × 3 × 52 × 7 × 9,829 × 19,379
200,000,000,550 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,550 ÷ 100,000,056 = 1,999 + 99,888,606
Step 2. Divide the smaller number by the above operation's remainder:
100,000,056 ÷ 99,888,606 = 1 + 111,450
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,888,606 ÷ 111,450 = 896 + 29,406
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
111,450 ÷ 29,406 = 3 + 23,232
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
29,406 ÷ 23,232 = 1 + 6,174
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,232 ÷ 6,174 = 3 + 4,710
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,174 ÷ 4,710 = 1 + 1,464
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,710 ÷ 1,464 = 3 + 318
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,464 ÷ 318 = 4 + 192
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
318 ÷ 192 = 1 + 126
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
192 ÷ 126 = 1 + 66
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
126 ÷ 66 = 1 + 60
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
66 ÷ 60 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
60 ÷ 6 = 10 + 0
At this step, the remainder is zero, so we stop:
6 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,056; 200,000,000,550) = 6 = 2 × 3
The two numbers have common prime factors