Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,089; 200,000,000,256) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,089 = 35 × 7 × 58,789
100,000,089 is not a prime number but a composite one.
200,000,000,256 = 28 × 3 × 7 × 5,843 × 6,367
200,000,000,256 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,256 ÷ 100,000,089 = 1,999 + 99,822,345
Step 2. Divide the smaller number by the above operation's remainder:
100,000,089 ÷ 99,822,345 = 1 + 177,744
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,822,345 ÷ 177,744 = 561 + 107,961
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
177,744 ÷ 107,961 = 1 + 69,783
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
107,961 ÷ 69,783 = 1 + 38,178
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
69,783 ÷ 38,178 = 1 + 31,605
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
38,178 ÷ 31,605 = 1 + 6,573
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
31,605 ÷ 6,573 = 4 + 5,313
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,573 ÷ 5,313 = 1 + 1,260
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
5,313 ÷ 1,260 = 4 + 273
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,260 ÷ 273 = 4 + 168
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
273 ÷ 168 = 1 + 105
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
168 ÷ 105 = 1 + 63
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
105 ÷ 63 = 1 + 42
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
63 ÷ 42 = 1 + 21
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
42 ÷ 21 = 2 + 0
At this step, the remainder is zero, so we stop:
21 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,089; 200,000,000,256) = 21 = 3 × 7
The two numbers have common prime factors