Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,104; 200,000,000,326) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,104 = 23 × 3 × 4,166,671
100,000,104 is not a prime number but a composite one.
200,000,000,326 = 2 × 7 × 59 × 257 × 942,143
200,000,000,326 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,326 ÷ 100,000,104 = 1,999 + 99,792,430
Step 2. Divide the smaller number by the above operation's remainder:
100,000,104 ÷ 99,792,430 = 1 + 207,674
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,792,430 ÷ 207,674 = 480 + 108,910
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
207,674 ÷ 108,910 = 1 + 98,764
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
108,910 ÷ 98,764 = 1 + 10,146
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
98,764 ÷ 10,146 = 9 + 7,450
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,146 ÷ 7,450 = 1 + 2,696
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,450 ÷ 2,696 = 2 + 2,058
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,696 ÷ 2,058 = 1 + 638
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
2,058 ÷ 638 = 3 + 144
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
638 ÷ 144 = 4 + 62
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
144 ÷ 62 = 2 + 20
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
62 ÷ 20 = 3 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
20 ÷ 2 = 10 + 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,104; 200,000,000,326) = 2
The two numbers have common prime factors