Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,056; 200,000,000,979) = ?
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,979 = 32 × 19 × 1,169,590,649
200,000,000,979 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,979 ÷ 100,000,056 = 1,999 + 99,889,035
Step 2. Divide the smaller number by the above operation's remainder:
100,000,056 ÷ 99,889,035 = 1 + 111,021
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,889,035 ÷ 111,021 = 899 + 81,156
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
111,021 ÷ 81,156 = 1 + 29,865
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
81,156 ÷ 29,865 = 2 + 21,426
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
29,865 ÷ 21,426 = 1 + 8,439
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,426 ÷ 8,439 = 2 + 4,548
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,439 ÷ 4,548 = 1 + 3,891
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,548 ÷ 3,891 = 1 + 657
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,891 ÷ 657 = 5 + 606
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
657 ÷ 606 = 1 + 51
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
606 ÷ 51 = 11 + 45
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
51 ÷ 45 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
45 ÷ 6 = 7 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 3 = 2 + 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,056; 200,000,000,979) = 3
The two numbers have common prime factors