Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,087; 200,000,000,783) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,087 = 112 × 199 × 4,153
100,000,087 is not a prime number but a composite one.
200,000,000,783 = 11 × 18,181,818,253
200,000,000,783 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,783 ÷ 100,000,087 = 1,999 + 99,826,870
Step 2. Divide the smaller number by the above operation's remainder:
100,000,087 ÷ 99,826,870 = 1 + 173,217
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,826,870 ÷ 173,217 = 576 + 53,878
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
173,217 ÷ 53,878 = 3 + 11,583
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
53,878 ÷ 11,583 = 4 + 7,546
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
11,583 ÷ 7,546 = 1 + 4,037
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,546 ÷ 4,037 = 1 + 3,509
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,037 ÷ 3,509 = 1 + 528
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,509 ÷ 528 = 6 + 341
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
528 ÷ 341 = 1 + 187
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
341 ÷ 187 = 1 + 154
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
187 ÷ 154 = 1 + 33
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
154 ÷ 33 = 4 + 22
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
33 ÷ 22 = 1 + 11
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
22 ÷ 11 = 2 + 0
At this step, the remainder is zero, so we stop:
11 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,087; 200,000,000,783) = 11
The two numbers have common prime factors