Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,046; 200,000,000,622) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,046 = 2 × 67 × 661 × 1,129
100,000,046 is not a prime number but a composite one.
200,000,000,622 = 2 × 3 × 131 × 2,039 × 124,793
200,000,000,622 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,622 ÷ 100,000,046 = 1,999 + 99,908,668
Step 2. Divide the smaller number by the above operation's remainder:
100,000,046 ÷ 99,908,668 = 1 + 91,378
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,908,668 ÷ 91,378 = 1,093 + 32,514
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
91,378 ÷ 32,514 = 2 + 26,350
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
32,514 ÷ 26,350 = 1 + 6,164
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
26,350 ÷ 6,164 = 4 + 1,694
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,164 ÷ 1,694 = 3 + 1,082
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,694 ÷ 1,082 = 1 + 612
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,082 ÷ 612 = 1 + 470
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
612 ÷ 470 = 1 + 142
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
470 ÷ 142 = 3 + 44
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
142 ÷ 44 = 3 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
44 ÷ 10 = 4 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 4 = 2 + 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,046; 200,000,000,622) = 2
The two numbers have common prime factors