Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,056; 200,000,000,730) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,056 = 23 × 3 × 13 × 320,513
100,000,056 is not a prime number but a composite one.
200,000,000,730 = 2 × 3 × 5 × 1,049 × 6,355,259
200,000,000,730 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,730 ÷ 100,000,056 = 1,999 + 99,888,786
Step 2. Divide the smaller number by the above operation's remainder:
100,000,056 ÷ 99,888,786 = 1 + 111,270
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,888,786 ÷ 111,270 = 897 + 79,596
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
111,270 ÷ 79,596 = 1 + 31,674
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
79,596 ÷ 31,674 = 2 + 16,248
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
31,674 ÷ 16,248 = 1 + 15,426
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
16,248 ÷ 15,426 = 1 + 822
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
15,426 ÷ 822 = 18 + 630
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
822 ÷ 630 = 1 + 192
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
630 ÷ 192 = 3 + 54
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
192 ÷ 54 = 3 + 30
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
54 ÷ 30 = 1 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
30 ÷ 24 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 6 = 4 + 0
At this step, the remainder is zero, so we stop:
6 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,056; 200,000,000,730) = 6 = 2 × 3
The two numbers have common prime factors