Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,086; 200,000,000,878) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,086 = 2 × 3 × 17 × 980,393
100,000,086 is not a prime number but a composite one.
200,000,000,878 = 2 × 17 × 5,882,352,967
200,000,000,878 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,878 ÷ 100,000,086 = 1,999 + 99,828,964
Step 2. Divide the smaller number by the above operation's remainder:
100,000,086 ÷ 99,828,964 = 1 + 171,122
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,828,964 ÷ 171,122 = 583 + 64,838
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
171,122 ÷ 64,838 = 2 + 41,446
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
64,838 ÷ 41,446 = 1 + 23,392
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
41,446 ÷ 23,392 = 1 + 18,054
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
23,392 ÷ 18,054 = 1 + 5,338
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
18,054 ÷ 5,338 = 3 + 2,040
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,338 ÷ 2,040 = 2 + 1,258
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,040 ÷ 1,258 = 1 + 782
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,258 ÷ 782 = 1 + 476
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
782 ÷ 476 = 1 + 306
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
476 ÷ 306 = 1 + 170
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
306 ÷ 170 = 1 + 136
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
170 ÷ 136 = 1 + 34
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
136 ÷ 34 = 4 + 0
At this step, the remainder is zero, so we stop:
34 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,086; 200,000,000,878) = 34 = 2 × 17
The two numbers have common prime factors