Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,116; 200,000,000,928) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,116 = 22 × 33 × 19 × 48,733
100,000,116 is not a prime number but a composite one.
200,000,000,928 = 25 × 3 × 72 × 13 × 277 × 11,807
200,000,000,928 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,928 ÷ 100,000,116 = 1,999 + 99,769,044
Step 2. Divide the smaller number by the above operation's remainder:
100,000,116 ÷ 99,769,044 = 1 + 231,072
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,769,044 ÷ 231,072 = 431 + 177,012
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
231,072 ÷ 177,012 = 1 + 54,060
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
177,012 ÷ 54,060 = 3 + 14,832
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
54,060 ÷ 14,832 = 3 + 9,564
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,832 ÷ 9,564 = 1 + 5,268
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,564 ÷ 5,268 = 1 + 4,296
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,268 ÷ 4,296 = 1 + 972
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,296 ÷ 972 = 4 + 408
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
972 ÷ 408 = 2 + 156
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
408 ÷ 156 = 2 + 96
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
156 ÷ 96 = 1 + 60
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
96 ÷ 60 = 1 + 36
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
60 ÷ 36 = 1 + 24
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
36 ÷ 24 = 1 + 12
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
24 ÷ 12 = 2 + 0
At this step, the remainder is zero, so we stop:
12 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,116; 200,000,000,928) = 12 = 22 × 3
The two numbers have common prime factors