Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,150; 200,000,000,972) = ?
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,972 = 22 × 53 × 943,396,231
200,000,000,972 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,972 ÷ 100,000,150 = 1,999 + 99,701,122
Step 2. Divide the smaller number by the above operation's remainder:
100,000,150 ÷ 99,701,122 = 1 + 299,028
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,701,122 ÷ 299,028 = 333 + 124,798
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
299,028 ÷ 124,798 = 2 + 49,432
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
124,798 ÷ 49,432 = 2 + 25,934
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
49,432 ÷ 25,934 = 1 + 23,498
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
25,934 ÷ 23,498 = 1 + 2,436
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
23,498 ÷ 2,436 = 9 + 1,574
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,436 ÷ 1,574 = 1 + 862
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,574 ÷ 862 = 1 + 712
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
862 ÷ 712 = 1 + 150
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
712 ÷ 150 = 4 + 112
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
150 ÷ 112 = 1 + 38
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
112 ÷ 38 = 2 + 36
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
38 ÷ 36 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
36 ÷ 2 = 18 + 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,150; 200,000,000,972) = 2
The two numbers have common prime factors