Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,068; 200,000,000,988) = ?
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,988 = 22 × 33 × 1,851,851,861
200,000,000,988 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,988 ÷ 100,000,068 = 1,999 + 99,865,056
Step 2. Divide the smaller number by the above operation's remainder:
100,000,068 ÷ 99,865,056 = 1 + 135,012
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,865,056 ÷ 135,012 = 739 + 91,188
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
135,012 ÷ 91,188 = 1 + 43,824
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
91,188 ÷ 43,824 = 2 + 3,540
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
43,824 ÷ 3,540 = 12 + 1,344
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,540 ÷ 1,344 = 2 + 852
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,344 ÷ 852 = 1 + 492
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
852 ÷ 492 = 1 + 360
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
492 ÷ 360 = 1 + 132
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
360 ÷ 132 = 2 + 96
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
132 ÷ 96 = 1 + 36
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
96 ÷ 36 = 2 + 24
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
36 ÷ 24 = 1 + 12
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
24 ÷ 12 = 2 + 0
At this step, the remainder is zero, so we stop:
12 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,988) = 12 = 22 × 3
The two numbers have common prime factors