Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (200,074; 69,999,982) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
200,074 = 2 × 7 × 31 × 461
200,074 is not a prime number but a composite one.
69,999,982 = 2 × 13 × 17 × 158,371
69,999,982 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:
69,999,982 ÷ 200,074 = 349 + 174,156
Step 2. Divide the smaller number by the above operation's remainder:
200,074 ÷ 174,156 = 1 + 25,918
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
174,156 ÷ 25,918 = 6 + 18,648
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
25,918 ÷ 18,648 = 1 + 7,270
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
18,648 ÷ 7,270 = 2 + 4,108
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,270 ÷ 4,108 = 1 + 3,162
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,108 ÷ 3,162 = 1 + 946
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,162 ÷ 946 = 3 + 324
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
946 ÷ 324 = 2 + 298
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
324 ÷ 298 = 1 + 26
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
298 ÷ 26 = 11 + 12
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
26 ÷ 12 = 2 + 2
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
12 ÷ 2 = 6 + 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 (200,074; 69,999,982) = 2
The two numbers have common prime factors