Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,043; 200,000,000,434) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,043 = 11 × 13 × 569 × 1,229
100,000,043 is not a prime number but a composite one.
200,000,000,434 = 2 × 13 × 13,093 × 587,513
200,000,000,434 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,434 ÷ 100,000,043 = 1,999 + 99,914,477
Step 2. Divide the smaller number by the above operation's remainder:
100,000,043 ÷ 99,914,477 = 1 + 85,566
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,914,477 ÷ 85,566 = 1,167 + 58,955
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
85,566 ÷ 58,955 = 1 + 26,611
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
58,955 ÷ 26,611 = 2 + 5,733
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
26,611 ÷ 5,733 = 4 + 3,679
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,733 ÷ 3,679 = 1 + 2,054
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,679 ÷ 2,054 = 1 + 1,625
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,054 ÷ 1,625 = 1 + 429
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,625 ÷ 429 = 3 + 338
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
429 ÷ 338 = 1 + 91
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
338 ÷ 91 = 3 + 65
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
91 ÷ 65 = 1 + 26
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
65 ÷ 26 = 2 + 13
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
26 ÷ 13 = 2 + 0
At this step, the remainder is zero, so we stop:
13 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,043; 200,000,000,434) = 13
The two numbers have common prime factors