Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,043; 200,000,000,299) = ?
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,299 = 11 × 18,181,818,209
200,000,000,299 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,299 ÷ 100,000,043 = 1,999 + 99,914,342
Step 2. Divide the smaller number by the above operation's remainder:
100,000,043 ÷ 99,914,342 = 1 + 85,701
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,914,342 ÷ 85,701 = 1,165 + 72,677
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
85,701 ÷ 72,677 = 1 + 13,024
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
72,677 ÷ 13,024 = 5 + 7,557
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,024 ÷ 7,557 = 1 + 5,467
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,557 ÷ 5,467 = 1 + 2,090
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,467 ÷ 2,090 = 2 + 1,287
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,090 ÷ 1,287 = 1 + 803
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,287 ÷ 803 = 1 + 484
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
803 ÷ 484 = 1 + 319
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
484 ÷ 319 = 1 + 165
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
319 ÷ 165 = 1 + 154
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
165 ÷ 154 = 1 + 11
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
154 ÷ 11 = 14 + 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,299) = 11
The two numbers have common prime factors