Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,146; 200,000,000,648) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,146 = 2 × 3 × 587 × 28,393
100,000,146 is not a prime number but a composite one.
200,000,000,648 = 23 × 7 × 3,571,428,583
200,000,000,648 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,648 ÷ 100,000,146 = 1,999 + 99,708,794
Step 2. Divide the smaller number by the above operation's remainder:
100,000,146 ÷ 99,708,794 = 1 + 291,352
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,708,794 ÷ 291,352 = 342 + 66,410
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
291,352 ÷ 66,410 = 4 + 25,712
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
66,410 ÷ 25,712 = 2 + 14,986
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
25,712 ÷ 14,986 = 1 + 10,726
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,986 ÷ 10,726 = 1 + 4,260
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
10,726 ÷ 4,260 = 2 + 2,206
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,260 ÷ 2,206 = 1 + 2,054
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,206 ÷ 2,054 = 1 + 152
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,054 ÷ 152 = 13 + 78
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
152 ÷ 78 = 1 + 74
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
78 ÷ 74 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
74 ÷ 4 = 18 + 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,146; 200,000,000,648) = 2
The two numbers have common prime factors