Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,078; 200,000,000,252) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,078 = 2 × 19 × 2,631,581
100,000,078 is not a prime number but a composite one.
200,000,000,252 = 22 × 13 × 71 × 54,171,181
200,000,000,252 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,252 ÷ 100,000,078 = 1,999 + 99,844,330
Step 2. Divide the smaller number by the above operation's remainder:
100,000,078 ÷ 99,844,330 = 1 + 155,748
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,844,330 ÷ 155,748 = 641 + 9,862
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
155,748 ÷ 9,862 = 15 + 7,818
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,862 ÷ 7,818 = 1 + 2,044
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
7,818 ÷ 2,044 = 3 + 1,686
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,044 ÷ 1,686 = 1 + 358
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,686 ÷ 358 = 4 + 254
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
358 ÷ 254 = 1 + 104
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
254 ÷ 104 = 2 + 46
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
104 ÷ 46 = 2 + 12
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
46 ÷ 12 = 3 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
12 ÷ 10 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 2 = 5 + 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,078; 200,000,000,252) = 2
The two numbers have common prime factors