Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,006; 200,000,000,650) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,006 = 2 × 491 × 101,833
100,000,006 is not a prime number but a composite one.
200,000,000,650 = 2 × 52 × 569 × 7,029,877
200,000,000,650 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,650 ÷ 100,000,006 = 1,999 + 99,988,656
Step 2. Divide the smaller number by the above operation's remainder:
100,000,006 ÷ 99,988,656 = 1 + 11,350
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,988,656 ÷ 11,350 = 8,809 + 6,506
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
11,350 ÷ 6,506 = 1 + 4,844
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
6,506 ÷ 4,844 = 1 + 1,662
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,844 ÷ 1,662 = 2 + 1,520
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
1,662 ÷ 1,520 = 1 + 142
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,520 ÷ 142 = 10 + 100
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
142 ÷ 100 = 1 + 42
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
100 ÷ 42 = 2 + 16
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
42 ÷ 16 = 2 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
16 ÷ 10 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
10 ÷ 6 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 4 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,006; 200,000,000,650) = 2
The two numbers have common prime factors