Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,056; 200,000,000,862) = ?
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,862 = 2 × 32 × 11,111,111,159
200,000,000,862 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,862 ÷ 100,000,056 = 1,999 + 99,888,918
Step 2. Divide the smaller number by the above operation's remainder:
100,000,056 ÷ 99,888,918 = 1 + 111,138
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,888,918 ÷ 111,138 = 898 + 86,994
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
111,138 ÷ 86,994 = 1 + 24,144
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
86,994 ÷ 24,144 = 3 + 14,562
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
24,144 ÷ 14,562 = 1 + 9,582
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
14,562 ÷ 9,582 = 1 + 4,980
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,582 ÷ 4,980 = 1 + 4,602
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,980 ÷ 4,602 = 1 + 378
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
4,602 ÷ 378 = 12 + 66
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
378 ÷ 66 = 5 + 48
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
66 ÷ 48 = 1 + 18
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
48 ÷ 18 = 2 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
18 ÷ 12 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 6 = 2 + 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,862) = 6 = 2 × 3
The two numbers have common prime factors