Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,068; 200,000,000,204) = ?
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,204 = 22 × 1,583 × 31,585,597
200,000,000,204 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,204 ÷ 100,000,068 = 1,999 + 99,864,272
Step 2. Divide the smaller number by the above operation's remainder:
100,000,068 ÷ 99,864,272 = 1 + 135,796
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,864,272 ÷ 135,796 = 735 + 54,212
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
135,796 ÷ 54,212 = 2 + 27,372
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
54,212 ÷ 27,372 = 1 + 26,840
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
27,372 ÷ 26,840 = 1 + 532
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
26,840 ÷ 532 = 50 + 240
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
532 ÷ 240 = 2 + 52
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
240 ÷ 52 = 4 + 32
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
52 ÷ 32 = 1 + 20
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
32 ÷ 20 = 1 + 12
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
20 ÷ 12 = 1 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
12 ÷ 8 = 1 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 4 = 2 + 0
At this step, the remainder is zero, so we stop:
4 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,204) = 4 = 22
The two numbers have common prime factors