Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,047; 200,000,001,303) = ?
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,001,303 = 32 × 172 × 43 × 1,788,221
200,000,001,303 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,001,303 ÷ 100,000,047 = 1,999 + 99,907,350
Step 2. Divide the smaller number by the above operation's remainder:
100,000,047 ÷ 99,907,350 = 1 + 92,697
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,907,350 ÷ 92,697 = 1,077 + 72,681
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
92,697 ÷ 72,681 = 1 + 20,016
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
72,681 ÷ 20,016 = 3 + 12,633
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
20,016 ÷ 12,633 = 1 + 7,383
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
12,633 ÷ 7,383 = 1 + 5,250
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,383 ÷ 5,250 = 1 + 2,133
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
5,250 ÷ 2,133 = 2 + 984
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,133 ÷ 984 = 2 + 165
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
984 ÷ 165 = 5 + 159
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
165 ÷ 159 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
159 ÷ 6 = 26 + 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,047; 200,000,001,303) = 3
The two numbers have common prime factors