Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,062; 200,000,000,148) = ?
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,148 = 22 × 3 × 13 × 31 × 83 × 498,271
200,000,000,148 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,148 ÷ 100,000,062 = 1,999 + 99,876,210
Step 2. Divide the smaller number by the above operation's remainder:
100,000,062 ÷ 99,876,210 = 1 + 123,852
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,876,210 ÷ 123,852 = 806 + 51,498
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
123,852 ÷ 51,498 = 2 + 20,856
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
51,498 ÷ 20,856 = 2 + 9,786
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
20,856 ÷ 9,786 = 2 + 1,284
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,786 ÷ 1,284 = 7 + 798
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,284 ÷ 798 = 1 + 486
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
798 ÷ 486 = 1 + 312
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
486 ÷ 312 = 1 + 174
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
312 ÷ 174 = 1 + 138
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
174 ÷ 138 = 1 + 36
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
138 ÷ 36 = 3 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
36 ÷ 30 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
30 ÷ 6 = 5 + 0
At this step, the remainder is zero, so we stop:
6 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,148) = 6 = 2 × 3
The two numbers have common prime factors