Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,113; 200,000,000,490) = ?
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,490 = 2 × 3 × 5 × 761 × 8,760,403
200,000,000,490 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,490 ÷ 100,000,113 = 1,999 + 99,774,603
Step 2. Divide the smaller number by the above operation's remainder:
100,000,113 ÷ 99,774,603 = 1 + 225,510
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,774,603 ÷ 225,510 = 442 + 99,183
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
225,510 ÷ 99,183 = 2 + 27,144
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
99,183 ÷ 27,144 = 3 + 17,751
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
27,144 ÷ 17,751 = 1 + 9,393
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,751 ÷ 9,393 = 1 + 8,358
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
9,393 ÷ 8,358 = 1 + 1,035
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
8,358 ÷ 1,035 = 8 + 78
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,035 ÷ 78 = 13 + 21
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
78 ÷ 21 = 3 + 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,113; 200,000,000,490) = 3
The two numbers have common prime factors