Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,023; 200,000,000,748) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,023 = 3 × 2,293 × 14,537
100,000,023 is not a prime number but a composite one.
200,000,000,748 = 22 × 3 × 16,666,666,729
200,000,000,748 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,748 ÷ 100,000,023 = 1,999 + 99,954,771
Step 2. Divide the smaller number by the above operation's remainder:
100,000,023 ÷ 99,954,771 = 1 + 45,252
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,954,771 ÷ 45,252 = 2,208 + 38,355
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
45,252 ÷ 38,355 = 1 + 6,897
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
38,355 ÷ 6,897 = 5 + 3,870
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,897 ÷ 3,870 = 1 + 3,027
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,870 ÷ 3,027 = 1 + 843
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,027 ÷ 843 = 3 + 498
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
843 ÷ 498 = 1 + 345
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
498 ÷ 345 = 1 + 153
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
345 ÷ 153 = 2 + 39
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
153 ÷ 39 = 3 + 36
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
39 ÷ 36 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
36 ÷ 3 = 12 + 0
At this step, the remainder is zero, so we stop:
3 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,023; 200,000,000,748) = 3
The two numbers have common prime factors