Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,050; 200,000,000,654) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,050 = 2 × 3 × 52 × 666,667
100,000,050 is not a prime number but a composite one.
200,000,000,654 = 2 × 53 × 13,417 × 140,627
200,000,000,654 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,654 ÷ 100,000,050 = 1,999 + 99,900,704
Step 2. Divide the smaller number by the above operation's remainder:
100,000,050 ÷ 99,900,704 = 1 + 99,346
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,900,704 ÷ 99,346 = 1,005 + 57,974
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
99,346 ÷ 57,974 = 1 + 41,372
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
57,974 ÷ 41,372 = 1 + 16,602
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
41,372 ÷ 16,602 = 2 + 8,168
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
16,602 ÷ 8,168 = 2 + 266
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
8,168 ÷ 266 = 30 + 188
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
266 ÷ 188 = 1 + 78
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
188 ÷ 78 = 2 + 32
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
78 ÷ 32 = 2 + 14
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
32 ÷ 14 = 2 + 4
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
14 ÷ 4 = 3 + 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,050; 200,000,000,654) = 2
The two numbers have common prime factors