Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,131; 200,000,000,643) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,131 = 3 × 72 × 11 × 61,843
100,000,131 is not a prime number but a composite one.
200,000,000,643 = 3 × 66,666,666,881
200,000,000,643 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,643 ÷ 100,000,131 = 1,999 + 99,738,774
Step 2. Divide the smaller number by the above operation's remainder:
100,000,131 ÷ 99,738,774 = 1 + 261,357
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,738,774 ÷ 261,357 = 381 + 161,757
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
261,357 ÷ 161,757 = 1 + 99,600
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
161,757 ÷ 99,600 = 1 + 62,157
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
99,600 ÷ 62,157 = 1 + 37,443
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
62,157 ÷ 37,443 = 1 + 24,714
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
37,443 ÷ 24,714 = 1 + 12,729
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
24,714 ÷ 12,729 = 1 + 11,985
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
12,729 ÷ 11,985 = 1 + 744
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
11,985 ÷ 744 = 16 + 81
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
744 ÷ 81 = 9 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
81 ÷ 15 = 5 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 6 = 2 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,131; 200,000,000,643) = 3
The two numbers have common prime factors