Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,150; 200,000,000,330) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,150 = 2 × 52 × 2,000,003
100,000,150 is not a prime number but a composite one.
200,000,000,330 = 2 × 5 × 13 × 61 × 25,220,681
200,000,000,330 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,330 ÷ 100,000,150 = 1,999 + 99,700,480
Step 2. Divide the smaller number by the above operation's remainder:
100,000,150 ÷ 99,700,480 = 1 + 299,670
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,700,480 ÷ 299,670 = 332 + 210,040
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
299,670 ÷ 210,040 = 1 + 89,630
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
210,040 ÷ 89,630 = 2 + 30,780
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
89,630 ÷ 30,780 = 2 + 28,070
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
30,780 ÷ 28,070 = 1 + 2,710
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
28,070 ÷ 2,710 = 10 + 970
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,710 ÷ 970 = 2 + 770
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
970 ÷ 770 = 1 + 200
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
770 ÷ 200 = 3 + 170
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
200 ÷ 170 = 1 + 30
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
170 ÷ 30 = 5 + 20
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
30 ÷ 20 = 1 + 10
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
20 ÷ 10 = 2 + 0
At this step, the remainder is zero, so we stop:
10 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,150; 200,000,000,330) = 10 = 2 × 5
The two numbers have common prime factors