Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,068; 200,000,000,307) = ?
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,307 = 3 × 337 × 977 × 202,481
200,000,000,307 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,307 ÷ 100,000,068 = 1,999 + 99,864,375
Step 2. Divide the smaller number by the above operation's remainder:
100,000,068 ÷ 99,864,375 = 1 + 135,693
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,864,375 ÷ 135,693 = 735 + 130,020
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
135,693 ÷ 130,020 = 1 + 5,673
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
130,020 ÷ 5,673 = 22 + 5,214
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,673 ÷ 5,214 = 1 + 459
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,214 ÷ 459 = 11 + 165
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
459 ÷ 165 = 2 + 129
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
165 ÷ 129 = 1 + 36
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
129 ÷ 36 = 3 + 21
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
36 ÷ 21 = 1 + 15
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
21 ÷ 15 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
15 ÷ 6 = 2 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,068; 200,000,000,307) = 3
The two numbers have common prime factors