Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,036; 200,000,000,702) = ?
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,702 = 2 × 14,813 × 6,750,827
200,000,000,702 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,702 ÷ 100,000,036 = 1,999 + 99,928,738
Step 2. Divide the smaller number by the above operation's remainder:
100,000,036 ÷ 99,928,738 = 1 + 71,298
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,928,738 ÷ 71,298 = 1,401 + 40,240
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
71,298 ÷ 40,240 = 1 + 31,058
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
40,240 ÷ 31,058 = 1 + 9,182
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
31,058 ÷ 9,182 = 3 + 3,512
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,182 ÷ 3,512 = 2 + 2,158
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,512 ÷ 2,158 = 1 + 1,354
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,158 ÷ 1,354 = 1 + 804
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,354 ÷ 804 = 1 + 550
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
804 ÷ 550 = 1 + 254
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
550 ÷ 254 = 2 + 42
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
254 ÷ 42 = 6 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
42 ÷ 2 = 21 + 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,702) = 2
The two numbers have common prime factors