Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,043; 200,000,000,596) = ?
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,596 = 22 × 11 × 40,151 × 113,209
200,000,000,596 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,596 ÷ 100,000,043 = 1,999 + 99,914,639
Step 2. Divide the smaller number by the above operation's remainder:
100,000,043 ÷ 99,914,639 = 1 + 85,404
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,914,639 ÷ 85,404 = 1,169 + 77,363
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
85,404 ÷ 77,363 = 1 + 8,041
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
77,363 ÷ 8,041 = 9 + 4,994
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,041 ÷ 4,994 = 1 + 3,047
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,994 ÷ 3,047 = 1 + 1,947
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,047 ÷ 1,947 = 1 + 1,100
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,947 ÷ 1,100 = 1 + 847
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,100 ÷ 847 = 1 + 253
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
847 ÷ 253 = 3 + 88
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
253 ÷ 88 = 2 + 77
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
88 ÷ 77 = 1 + 11
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
77 ÷ 11 = 7 + 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,043; 200,000,000,596) = 11
The two numbers have common prime factors