Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,090; 200,000,000,358) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,090 = 2 × 5 × 23 × 434,783
100,000,090 is not a prime number but a composite one.
200,000,000,358 = 2 × 32 × 11,111,111,131
200,000,000,358 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,358 ÷ 100,000,090 = 1,999 + 99,820,448
Step 2. Divide the smaller number by the above operation's remainder:
100,000,090 ÷ 99,820,448 = 1 + 179,642
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,820,448 ÷ 179,642 = 555 + 119,138
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
179,642 ÷ 119,138 = 1 + 60,504
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
119,138 ÷ 60,504 = 1 + 58,634
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
60,504 ÷ 58,634 = 1 + 1,870
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
58,634 ÷ 1,870 = 31 + 664
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,870 ÷ 664 = 2 + 542
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
664 ÷ 542 = 1 + 122
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
542 ÷ 122 = 4 + 54
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
122 ÷ 54 = 2 + 14
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
54 ÷ 14 = 3 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
14 ÷ 12 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 2 = 6 + 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,090; 200,000,000,358) = 2
The two numbers have common prime factors