Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,137; 200,000,000,544) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,137 = 3 × 17 × 1,960,787
100,000,137 is not a prime number but a composite one.
200,000,000,544 = 25 × 3 × 3,643 × 571,873
200,000,000,544 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,544 ÷ 100,000,137 = 1,999 + 99,726,681
Step 2. Divide the smaller number by the above operation's remainder:
100,000,137 ÷ 99,726,681 = 1 + 273,456
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,726,681 ÷ 273,456 = 364 + 188,697
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
273,456 ÷ 188,697 = 1 + 84,759
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
188,697 ÷ 84,759 = 2 + 19,179
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
84,759 ÷ 19,179 = 4 + 8,043
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
19,179 ÷ 8,043 = 2 + 3,093
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,043 ÷ 3,093 = 2 + 1,857
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,093 ÷ 1,857 = 1 + 1,236
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,857 ÷ 1,236 = 1 + 621
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,236 ÷ 621 = 1 + 615
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
621 ÷ 615 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
615 ÷ 6 = 102 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,137; 200,000,000,544) = 3
The two numbers have common prime factors