Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,047; 200,000,000,694) = ?
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,694 = 2 × 3 × 13 × 19 × 313 × 359 × 1,201
200,000,000,694 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,694 ÷ 100,000,047 = 1,999 + 99,906,741
Step 2. Divide the smaller number by the above operation's remainder:
100,000,047 ÷ 99,906,741 = 1 + 93,306
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,906,741 ÷ 93,306 = 1,070 + 69,321
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
93,306 ÷ 69,321 = 1 + 23,985
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
69,321 ÷ 23,985 = 2 + 21,351
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,985 ÷ 21,351 = 1 + 2,634
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,351 ÷ 2,634 = 8 + 279
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,634 ÷ 279 = 9 + 123
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
279 ÷ 123 = 2 + 33
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
123 ÷ 33 = 3 + 24
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
33 ÷ 24 = 1 + 9
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
24 ÷ 9 = 2 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
9 ÷ 6 = 1 + 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,000,694) = 3
The two numbers have common prime factors