Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,162; 200,000,000,056) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,162 = 2 × 59 × 443 × 1,913
100,000,162 is not a prime number but a composite one.
200,000,000,056 = 23 × 43 × 181 × 269 × 11,941
200,000,000,056 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,056 ÷ 100,000,162 = 1,999 + 99,676,218
Step 2. Divide the smaller number by the above operation's remainder:
100,000,162 ÷ 99,676,218 = 1 + 323,944
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,676,218 ÷ 323,944 = 307 + 225,410
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
323,944 ÷ 225,410 = 1 + 98,534
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
225,410 ÷ 98,534 = 2 + 28,342
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
98,534 ÷ 28,342 = 3 + 13,508
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
28,342 ÷ 13,508 = 2 + 1,326
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
13,508 ÷ 1,326 = 10 + 248
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,326 ÷ 248 = 5 + 86
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
248 ÷ 86 = 2 + 76
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
86 ÷ 76 = 1 + 10
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
76 ÷ 10 = 7 + 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,162; 200,000,000,056) = 2
The two numbers have common prime factors