Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,074; 200,000,000,546) = ?
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,546 = 2 × 306,169 × 326,617
200,000,000,546 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,546 ÷ 100,000,074 = 1,999 + 99,852,620
Step 2. Divide the smaller number by the above operation's remainder:
100,000,074 ÷ 99,852,620 = 1 + 147,454
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,852,620 ÷ 147,454 = 677 + 26,262
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
147,454 ÷ 26,262 = 5 + 16,144
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
26,262 ÷ 16,144 = 1 + 10,118
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
16,144 ÷ 10,118 = 1 + 6,026
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
10,118 ÷ 6,026 = 1 + 4,092
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,026 ÷ 4,092 = 1 + 1,934
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,092 ÷ 1,934 = 2 + 224
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,934 ÷ 224 = 8 + 142
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
224 ÷ 142 = 1 + 82
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
142 ÷ 82 = 1 + 60
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
82 ÷ 60 = 1 + 22
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
60 ÷ 22 = 2 + 16
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
22 ÷ 16 = 1 + 6
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
16 ÷ 6 = 2 + 4
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
6 ÷ 4 = 1 + 2
Step 18. Divide the remainder of the step 16 by the remainder of the step 17:
4 ÷ 2 = 2 + 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,074; 200,000,000,546) = 2
The two numbers have common prime factors