Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,054; 200,000,000,964) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,054 = 2 × 7 × 11 × 127 × 5,113
100,000,054 is not a prime number but a composite one.
200,000,000,964 = 22 × 3 × 41 × 16,477 × 24,671
200,000,000,964 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,964 ÷ 100,000,054 = 1,999 + 99,893,018
Step 2. Divide the smaller number by the above operation's remainder:
100,000,054 ÷ 99,893,018 = 1 + 107,036
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,893,018 ÷ 107,036 = 933 + 28,430
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
107,036 ÷ 28,430 = 3 + 21,746
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
28,430 ÷ 21,746 = 1 + 6,684
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
21,746 ÷ 6,684 = 3 + 1,694
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,684 ÷ 1,694 = 3 + 1,602
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,694 ÷ 1,602 = 1 + 92
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,602 ÷ 92 = 17 + 38
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
92 ÷ 38 = 2 + 16
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
38 ÷ 16 = 2 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
16 ÷ 6 = 2 + 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,054; 200,000,000,964) = 2
The two numbers have common prime factors