Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,068; 200,000,000,250) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,068 = 22 × 3 × 7 × 1,190,477
100,000,068 is not a prime number but a composite one.
200,000,000,250 = 2 × 32 × 53 × 251 × 354,139
200,000,000,250 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,250 ÷ 100,000,068 = 1,999 + 99,864,318
Step 2. Divide the smaller number by the above operation's remainder:
100,000,068 ÷ 99,864,318 = 1 + 135,750
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,864,318 ÷ 135,750 = 735 + 88,068
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
135,750 ÷ 88,068 = 1 + 47,682
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
88,068 ÷ 47,682 = 1 + 40,386
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
47,682 ÷ 40,386 = 1 + 7,296
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
40,386 ÷ 7,296 = 5 + 3,906
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,296 ÷ 3,906 = 1 + 3,390
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,906 ÷ 3,390 = 1 + 516
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,390 ÷ 516 = 6 + 294
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
516 ÷ 294 = 1 + 222
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
294 ÷ 222 = 1 + 72
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
222 ÷ 72 = 3 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
72 ÷ 6 = 12 + 0
At this step, the remainder is zero, so we stop:
6 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,068; 200,000,000,250) = 6 = 2 × 3
The two numbers have common prime factors