Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,128; 200,000,000,595) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,128 = 27 × 3 × 260,417
100,000,128 is not a prime number but a composite one.
200,000,000,595 = 3 × 5 × 41 × 3,631 × 89,563
200,000,000,595 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,595 ÷ 100,000,128 = 1,999 + 99,744,723
Step 2. Divide the smaller number by the above operation's remainder:
100,000,128 ÷ 99,744,723 = 1 + 255,405
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,744,723 ÷ 255,405 = 390 + 136,773
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
255,405 ÷ 136,773 = 1 + 118,632
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
136,773 ÷ 118,632 = 1 + 18,141
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
118,632 ÷ 18,141 = 6 + 9,786
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
18,141 ÷ 9,786 = 1 + 8,355
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,786 ÷ 8,355 = 1 + 1,431
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
8,355 ÷ 1,431 = 5 + 1,200
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,431 ÷ 1,200 = 1 + 231
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,200 ÷ 231 = 5 + 45
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
231 ÷ 45 = 5 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
45 ÷ 6 = 7 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,128; 200,000,000,595) = 3
The two numbers have common prime factors