Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,062; 200,000,000,114) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,062 = 2 × 33 × 29 × 63,857
100,000,062 is not a prime number but a composite one.
200,000,000,114 = 2 × 100,000,000,057
200,000,000,114 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,114 ÷ 100,000,062 = 1,999 + 99,876,176
Step 2. Divide the smaller number by the above operation's remainder:
100,000,062 ÷ 99,876,176 = 1 + 123,886
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,876,176 ÷ 123,886 = 806 + 24,060
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
123,886 ÷ 24,060 = 5 + 3,586
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
24,060 ÷ 3,586 = 6 + 2,544
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,586 ÷ 2,544 = 1 + 1,042
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,544 ÷ 1,042 = 2 + 460
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,042 ÷ 460 = 2 + 122
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
460 ÷ 122 = 3 + 94
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
122 ÷ 94 = 1 + 28
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
94 ÷ 28 = 3 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
28 ÷ 10 = 2 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 8 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 2 = 4 + 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,062; 200,000,000,114) = 2
The two numbers have common prime factors