Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,062; 200,000,000,312) = ?
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,312 = 23 × 7 × 3,571,428,577
200,000,000,312 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,312 ÷ 100,000,062 = 1,999 + 99,876,374
Step 2. Divide the smaller number by the above operation's remainder:
100,000,062 ÷ 99,876,374 = 1 + 123,688
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,876,374 ÷ 123,688 = 807 + 60,158
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
123,688 ÷ 60,158 = 2 + 3,372
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
60,158 ÷ 3,372 = 17 + 2,834
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,372 ÷ 2,834 = 1 + 538
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,834 ÷ 538 = 5 + 144
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
538 ÷ 144 = 3 + 106
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
144 ÷ 106 = 1 + 38
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
106 ÷ 38 = 2 + 30
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
38 ÷ 30 = 1 + 8
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
30 ÷ 8 = 3 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
8 ÷ 6 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 2 = 3 + 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,312) = 2
The two numbers have common prime factors