Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,110; 200,000,000,673) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,110 = 2 × 3 × 5 × 7 × 31 × 15,361
100,000,110 is not a prime number but a composite one.
200,000,000,673 = 32 × 11 × 1,439 × 1,403,893
200,000,000,673 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,673 ÷ 100,000,110 = 1,999 + 99,780,783
Step 2. Divide the smaller number by the above operation's remainder:
100,000,110 ÷ 99,780,783 = 1 + 219,327
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,780,783 ÷ 219,327 = 454 + 206,325
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
219,327 ÷ 206,325 = 1 + 13,002
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
206,325 ÷ 13,002 = 15 + 11,295
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
13,002 ÷ 11,295 = 1 + 1,707
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
11,295 ÷ 1,707 = 6 + 1,053
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,707 ÷ 1,053 = 1 + 654
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,053 ÷ 654 = 1 + 399
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
654 ÷ 399 = 1 + 255
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
399 ÷ 255 = 1 + 144
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
255 ÷ 144 = 1 + 111
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
144 ÷ 111 = 1 + 33
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
111 ÷ 33 = 3 + 12
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
33 ÷ 12 = 2 + 9
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
12 ÷ 9 = 1 + 3
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
9 ÷ 3 = 3 + 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,110; 200,000,000,673) = 3
The two numbers have common prime factors