Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,208; 200,000,000,725) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,208 = 24 × 7 × 112 × 47 × 157
100,000,208 is not a prime number but a composite one.
200,000,000,725 = 52 × 7 × 173 × 37 × 6,287
200,000,000,725 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,725 ÷ 100,000,208 = 1,999 + 99,584,933
Step 2. Divide the smaller number by the above operation's remainder:
100,000,208 ÷ 99,584,933 = 1 + 415,275
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,584,933 ÷ 415,275 = 239 + 334,208
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
415,275 ÷ 334,208 = 1 + 81,067
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
334,208 ÷ 81,067 = 4 + 9,940
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
81,067 ÷ 9,940 = 8 + 1,547
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,940 ÷ 1,547 = 6 + 658
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,547 ÷ 658 = 2 + 231
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
658 ÷ 231 = 2 + 196
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
231 ÷ 196 = 1 + 35
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
196 ÷ 35 = 5 + 21
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
35 ÷ 21 = 1 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
21 ÷ 14 = 1 + 7
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 7 = 2 + 0
At this step, the remainder is zero, so we stop:
7 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,208; 200,000,000,725) = 7
The two numbers have common prime factors