Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,101; 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,101 = 3 × 167 × 199,601
100,000,101 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,101 = 1,999 + 99,798,744
Step 2. Divide the smaller number by the above operation's remainder:
100,000,101 ÷ 99,798,744 = 1 + 201,357
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,798,744 ÷ 201,357 = 495 + 127,029
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
201,357 ÷ 127,029 = 1 + 74,328
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
127,029 ÷ 74,328 = 1 + 52,701
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
74,328 ÷ 52,701 = 1 + 21,627
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
52,701 ÷ 21,627 = 2 + 9,447
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
21,627 ÷ 9,447 = 2 + 2,733
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
9,447 ÷ 2,733 = 3 + 1,248
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,733 ÷ 1,248 = 2 + 237
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,248 ÷ 237 = 5 + 63
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
237 ÷ 63 = 3 + 48
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
63 ÷ 48 = 1 + 15
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
48 ÷ 15 = 3 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
15 ÷ 3 = 5 + 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,101; 200,000,000,643) = 3
The two numbers have common prime factors