Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,054; 200,000,000,958) = ?
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,958 = 2 × 3 × 89 × 10,253 × 36,529
200,000,000,958 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,958 ÷ 100,000,054 = 1,999 + 99,893,012
Step 2. Divide the smaller number by the above operation's remainder:
100,000,054 ÷ 99,893,012 = 1 + 107,042
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,893,012 ÷ 107,042 = 933 + 22,826
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
107,042 ÷ 22,826 = 4 + 15,738
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
22,826 ÷ 15,738 = 1 + 7,088
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
15,738 ÷ 7,088 = 2 + 1,562
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
7,088 ÷ 1,562 = 4 + 840
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,562 ÷ 840 = 1 + 722
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
840 ÷ 722 = 1 + 118
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
722 ÷ 118 = 6 + 14
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
118 ÷ 14 = 8 + 6
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
14 ÷ 6 = 2 + 2
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
6 ÷ 2 = 3 + 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,958) = 2
The two numbers have common prime factors