Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,028; 200,000,000,982) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,028 = 22 × 113 × 221,239
100,000,028 is not a prime number but a composite one.
200,000,000,982 = 2 × 3 × 29 × 599 × 691 × 2,777
200,000,000,982 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,982 ÷ 100,000,028 = 1,999 + 99,945,010
Step 2. Divide the smaller number by the above operation's remainder:
100,000,028 ÷ 99,945,010 = 1 + 55,018
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,945,010 ÷ 55,018 = 1,816 + 32,322
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
55,018 ÷ 32,322 = 1 + 22,696
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
32,322 ÷ 22,696 = 1 + 9,626
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
22,696 ÷ 9,626 = 2 + 3,444
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,626 ÷ 3,444 = 2 + 2,738
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,444 ÷ 2,738 = 1 + 706
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,738 ÷ 706 = 3 + 620
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
706 ÷ 620 = 1 + 86
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
620 ÷ 86 = 7 + 18
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
86 ÷ 18 = 4 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
18 ÷ 14 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 4 = 3 + 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,028; 200,000,000,982) = 2
The two numbers have common prime factors