Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,082; 200,000,000,662) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,082 = 2 × 72 × 13 × 53 × 1,481
100,000,082 is not a prime number but a composite one.
200,000,000,662 = 2 × 7 × 11 × 79 × 16,439,257
200,000,000,662 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,662 ÷ 100,000,082 = 1,999 + 99,836,744
Step 2. Divide the smaller number by the above operation's remainder:
100,000,082 ÷ 99,836,744 = 1 + 163,338
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,836,744 ÷ 163,338 = 611 + 37,226
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
163,338 ÷ 37,226 = 4 + 14,434
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
37,226 ÷ 14,434 = 2 + 8,358
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
14,434 ÷ 8,358 = 1 + 6,076
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,358 ÷ 6,076 = 1 + 2,282
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,076 ÷ 2,282 = 2 + 1,512
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,282 ÷ 1,512 = 1 + 770
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,512 ÷ 770 = 1 + 742
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
770 ÷ 742 = 1 + 28
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
742 ÷ 28 = 26 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
28 ÷ 14 = 2 + 0
At this step, the remainder is zero, so we stop:
14 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,082; 200,000,000,662) = 14 = 2 × 7
The two numbers have common prime factors