Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,053; 200,000,000,220) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,053 = 32 × 11,111,117
100,000,053 is not a prime number but a composite one.
200,000,000,220 = 22 × 3 × 5 × 191 × 17,452,007
200,000,000,220 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,220 ÷ 100,000,053 = 1,999 + 99,894,273
Step 2. Divide the smaller number by the above operation's remainder:
100,000,053 ÷ 99,894,273 = 1 + 105,780
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,894,273 ÷ 105,780 = 944 + 37,953
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
105,780 ÷ 37,953 = 2 + 29,874
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
37,953 ÷ 29,874 = 1 + 8,079
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
29,874 ÷ 8,079 = 3 + 5,637
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
8,079 ÷ 5,637 = 1 + 2,442
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,637 ÷ 2,442 = 2 + 753
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,442 ÷ 753 = 3 + 183
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
753 ÷ 183 = 4 + 21
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
183 ÷ 21 = 8 + 15
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
21 ÷ 15 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
15 ÷ 6 = 2 + 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,053; 200,000,000,220) = 3
The two numbers have common prime factors