Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,118; 200,000,000,432) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,118 = 2 × 50,000,059
100,000,118 is not a prime number but a composite one.
200,000,000,432 = 24 × 12,500,000,027
200,000,000,432 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,432 ÷ 100,000,118 = 1,999 + 99,764,550
Step 2. Divide the smaller number by the above operation's remainder:
100,000,118 ÷ 99,764,550 = 1 + 235,568
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,764,550 ÷ 235,568 = 423 + 119,286
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
235,568 ÷ 119,286 = 1 + 116,282
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
119,286 ÷ 116,282 = 1 + 3,004
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
116,282 ÷ 3,004 = 38 + 2,130
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,004 ÷ 2,130 = 1 + 874
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,130 ÷ 874 = 2 + 382
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
874 ÷ 382 = 2 + 110
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
382 ÷ 110 = 3 + 52
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
110 ÷ 52 = 2 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
52 ÷ 6 = 8 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
6 ÷ 4 = 1 + 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,118; 200,000,000,432) = 2
The two numbers have common prime factors