Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,194; 200,000,000,230) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,194 = 2 × 3 × 7 × 2,380,957
100,000,194 is not a prime number but a composite one.
200,000,000,230 = 2 × 5 × 53 × 4,339 × 86,969
200,000,000,230 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,230 ÷ 100,000,194 = 1,999 + 99,612,424
Step 2. Divide the smaller number by the above operation's remainder:
100,000,194 ÷ 99,612,424 = 1 + 387,770
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,612,424 ÷ 387,770 = 256 + 343,304
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
387,770 ÷ 343,304 = 1 + 44,466
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
343,304 ÷ 44,466 = 7 + 32,042
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
44,466 ÷ 32,042 = 1 + 12,424
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
32,042 ÷ 12,424 = 2 + 7,194
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12,424 ÷ 7,194 = 1 + 5,230
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
7,194 ÷ 5,230 = 1 + 1,964
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
5,230 ÷ 1,964 = 2 + 1,302
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,964 ÷ 1,302 = 1 + 662
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
1,302 ÷ 662 = 1 + 640
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
662 ÷ 640 = 1 + 22
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
640 ÷ 22 = 29 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
22 ÷ 2 = 11 + 0
At this step, the remainder is zero, so we stop:
2 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,194; 200,000,000,230) = 2
The two numbers have common prime factors