Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,184; 200,000,000,158) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,184 = 23 × 311 × 40,193
100,000,184 is not a prime number but a composite one.
200,000,000,158 = 2 × 7 × 139 × 163 × 630,521
200,000,000,158 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,158 ÷ 100,000,184 = 1,999 + 99,632,342
Step 2. Divide the smaller number by the above operation's remainder:
100,000,184 ÷ 99,632,342 = 1 + 367,842
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,632,342 ÷ 367,842 = 270 + 315,002
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
367,842 ÷ 315,002 = 1 + 52,840
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
315,002 ÷ 52,840 = 5 + 50,802
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
52,840 ÷ 50,802 = 1 + 2,038
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
50,802 ÷ 2,038 = 24 + 1,890
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,038 ÷ 1,890 = 1 + 148
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,890 ÷ 148 = 12 + 114
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
148 ÷ 114 = 1 + 34
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
114 ÷ 34 = 3 + 12
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
34 ÷ 12 = 2 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
12 ÷ 10 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 2 = 5 + 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,184; 200,000,000,158) = 2
The two numbers have common prime factors