Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,113; 200,000,000,670) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,113 = 3 × 23 × 67 × 97 × 223
100,000,113 is not a prime number but a composite one.
200,000,000,670 = 2 × 3 × 5 × 9,311 × 715,999
200,000,000,670 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,670 ÷ 100,000,113 = 1,999 + 99,774,783
Step 2. Divide the smaller number by the above operation's remainder:
100,000,113 ÷ 99,774,783 = 1 + 225,330
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,774,783 ÷ 225,330 = 442 + 178,923
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
225,330 ÷ 178,923 = 1 + 46,407
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
178,923 ÷ 46,407 = 3 + 39,702
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
46,407 ÷ 39,702 = 1 + 6,705
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
39,702 ÷ 6,705 = 5 + 6,177
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,705 ÷ 6,177 = 1 + 528
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,177 ÷ 528 = 11 + 369
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
528 ÷ 369 = 1 + 159
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
369 ÷ 159 = 2 + 51
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
159 ÷ 51 = 3 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
51 ÷ 6 = 8 + 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,113; 200,000,000,670) = 3
The two numbers have common prime factors