Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,074; 200,000,000,775) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,074 = 2 × 3 × 211 × 78,989
100,000,074 is not a prime number but a composite one.
200,000,000,775 = 3 × 52 × 281 × 9,489,917
200,000,000,775 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,775 ÷ 100,000,074 = 1,999 + 99,852,849
Step 2. Divide the smaller number by the above operation's remainder:
100,000,074 ÷ 99,852,849 = 1 + 147,225
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,852,849 ÷ 147,225 = 678 + 34,299
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
147,225 ÷ 34,299 = 4 + 10,029
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
34,299 ÷ 10,029 = 3 + 4,212
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
10,029 ÷ 4,212 = 2 + 1,605
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,212 ÷ 1,605 = 2 + 1,002
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,605 ÷ 1,002 = 1 + 603
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,002 ÷ 603 = 1 + 399
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
603 ÷ 399 = 1 + 204
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
399 ÷ 204 = 1 + 195
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
204 ÷ 195 = 1 + 9
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
195 ÷ 9 = 21 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
9 ÷ 6 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,074; 200,000,000,775) = 3
The two numbers have common prime factors