Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,167; 200,000,000,595) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,167 = 3 × 61 × 107 × 5,107
100,000,167 is not a prime number but a composite one.
200,000,000,595 = 3 × 5 × 41 × 3,631 × 89,563
200,000,000,595 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,595 ÷ 100,000,167 = 1,999 + 99,666,762
Step 2. Divide the smaller number by the above operation's remainder:
100,000,167 ÷ 99,666,762 = 1 + 333,405
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,666,762 ÷ 333,405 = 298 + 312,072
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
333,405 ÷ 312,072 = 1 + 21,333
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
312,072 ÷ 21,333 = 14 + 13,410
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
21,333 ÷ 13,410 = 1 + 7,923
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
13,410 ÷ 7,923 = 1 + 5,487
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,923 ÷ 5,487 = 1 + 2,436
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,487 ÷ 2,436 = 2 + 615
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,436 ÷ 615 = 3 + 591
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
615 ÷ 591 = 1 + 24
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
591 ÷ 24 = 24 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
24 ÷ 15 = 1 + 9
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 9 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
9 ÷ 6 = 1 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,167; 200,000,000,595) = 3
The two numbers have common prime factors