Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,040; 200,000,000,206) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,040 = 23 × 5 × 7 × 19 × 18,797
100,000,040 is not a prime number but a composite one.
200,000,000,206 = 2 × 100,000,000,103
200,000,000,206 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,206 ÷ 100,000,040 = 1,999 + 99,920,246
Step 2. Divide the smaller number by the above operation's remainder:
100,000,040 ÷ 99,920,246 = 1 + 79,794
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,920,246 ÷ 79,794 = 1,252 + 18,158
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
79,794 ÷ 18,158 = 4 + 7,162
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
18,158 ÷ 7,162 = 2 + 3,834
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,162 ÷ 3,834 = 1 + 3,328
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,834 ÷ 3,328 = 1 + 506
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,328 ÷ 506 = 6 + 292
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
506 ÷ 292 = 1 + 214
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
292 ÷ 214 = 1 + 78
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
214 ÷ 78 = 2 + 58
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
78 ÷ 58 = 1 + 20
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
58 ÷ 20 = 2 + 18
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
20 ÷ 18 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
18 ÷ 2 = 9 + 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,040; 200,000,000,206) = 2
The two numbers have common prime factors