Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,047; 200,000,000,271) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,047 = 3 × 7 × 277 × 17,191
100,000,047 is not a prime number but a composite one.
200,000,000,271 = 3 × 43 × 1,550,387,599
200,000,000,271 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,271 ÷ 100,000,047 = 1,999 + 99,906,318
Step 2. Divide the smaller number by the above operation's remainder:
100,000,047 ÷ 99,906,318 = 1 + 93,729
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,906,318 ÷ 93,729 = 1,065 + 84,933
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
93,729 ÷ 84,933 = 1 + 8,796
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
84,933 ÷ 8,796 = 9 + 5,769
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
8,796 ÷ 5,769 = 1 + 3,027
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,769 ÷ 3,027 = 1 + 2,742
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,027 ÷ 2,742 = 1 + 285
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,742 ÷ 285 = 9 + 177
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
285 ÷ 177 = 1 + 108
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
177 ÷ 108 = 1 + 69
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
108 ÷ 69 = 1 + 39
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
69 ÷ 39 = 1 + 30
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
39 ÷ 30 = 1 + 9
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
30 ÷ 9 = 3 + 3
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
9 ÷ 3 = 3 + 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,047; 200,000,000,271) = 3
The two numbers have common prime factors