Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,068; 200,000,000,566) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,068 = 22 × 3 × 7 × 1,190,477
100,000,068 is not a prime number but a composite one.
200,000,000,566 = 2 × 100,000,000,283
200,000,000,566 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,566 ÷ 100,000,068 = 1,999 + 99,864,634
Step 2. Divide the smaller number by the above operation's remainder:
100,000,068 ÷ 99,864,634 = 1 + 135,434
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,864,634 ÷ 135,434 = 737 + 49,776
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
135,434 ÷ 49,776 = 2 + 35,882
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
49,776 ÷ 35,882 = 1 + 13,894
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
35,882 ÷ 13,894 = 2 + 8,094
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
13,894 ÷ 8,094 = 1 + 5,800
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,094 ÷ 5,800 = 1 + 2,294
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,800 ÷ 2,294 = 2 + 1,212
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,294 ÷ 1,212 = 1 + 1,082
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,212 ÷ 1,082 = 1 + 130
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
1,082 ÷ 130 = 8 + 42
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
130 ÷ 42 = 3 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
42 ÷ 4 = 10 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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,068; 200,000,000,566) = 2
The two numbers have common prime factors