Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,082; 200,000,000,718) = ?
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,718 = 2 × 33 × 7 × 41 × 1,499 × 8,609
200,000,000,718 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,718 ÷ 100,000,082 = 1,999 + 99,836,800
Step 2. Divide the smaller number by the above operation's remainder:
100,000,082 ÷ 99,836,800 = 1 + 163,282
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,836,800 ÷ 163,282 = 611 + 71,498
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
163,282 ÷ 71,498 = 2 + 20,286
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
71,498 ÷ 20,286 = 3 + 10,640
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
20,286 ÷ 10,640 = 1 + 9,646
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,640 ÷ 9,646 = 1 + 994
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,646 ÷ 994 = 9 + 700
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
994 ÷ 700 = 1 + 294
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
700 ÷ 294 = 2 + 112
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
294 ÷ 112 = 2 + 70
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
112 ÷ 70 = 1 + 42
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
70 ÷ 42 = 1 + 28
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
42 ÷ 28 = 1 + 14
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,718) = 14 = 2 × 7
The two numbers have common prime factors