Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,036; 200,000,000,538) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,036 = 22 × 25,000,009
100,000,036 is not a prime number but a composite one.
200,000,000,538 = 2 × 32 × 13 × 17 × 50,276,521
200,000,000,538 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,538 ÷ 100,000,036 = 1,999 + 99,928,574
Step 2. Divide the smaller number by the above operation's remainder:
100,000,036 ÷ 99,928,574 = 1 + 71,462
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,928,574 ÷ 71,462 = 1,398 + 24,698
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
71,462 ÷ 24,698 = 2 + 22,066
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
24,698 ÷ 22,066 = 1 + 2,632
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
22,066 ÷ 2,632 = 8 + 1,010
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,632 ÷ 1,010 = 2 + 612
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,010 ÷ 612 = 1 + 398
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
612 ÷ 398 = 1 + 214
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
398 ÷ 214 = 1 + 184
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
214 ÷ 184 = 1 + 30
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
184 ÷ 30 = 6 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
30 ÷ 4 = 7 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
4 ÷ 2 = 2 + 0
At this step, the remainder is zero, so we stop:
2 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,036; 200,000,000,538) = 2
The two numbers have common prime factors