Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,134; 200,000,000,768) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,134 = 2 × 32 × 13 × 427,351
100,000,134 is not a prime number but a composite one.
200,000,000,768 = 28 × 31 × 25,201,613
200,000,000,768 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,768 ÷ 100,000,134 = 1,999 + 99,732,902
Step 2. Divide the smaller number by the above operation's remainder:
100,000,134 ÷ 99,732,902 = 1 + 267,232
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,732,902 ÷ 267,232 = 373 + 55,366
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
267,232 ÷ 55,366 = 4 + 45,768
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
55,366 ÷ 45,768 = 1 + 9,598
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
45,768 ÷ 9,598 = 4 + 7,376
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,598 ÷ 7,376 = 1 + 2,222
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,376 ÷ 2,222 = 3 + 710
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,222 ÷ 710 = 3 + 92
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
710 ÷ 92 = 7 + 66
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
92 ÷ 66 = 1 + 26
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
66 ÷ 26 = 2 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
26 ÷ 14 = 1 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 12 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 2 = 6 + 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,134; 200,000,000,768) = 2
The two numbers have common prime factors