Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,023; 200,000,000,718) = ?
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,718 = 2 × 33 × 7 × 41 × 1,499 × 8,609
200,000,000,718 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,718 ÷ 100,000,023 = 1,999 + 99,954,741
Step 2. Divide the smaller number by the above operation's remainder:
100,000,023 ÷ 99,954,741 = 1 + 45,282
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,954,741 ÷ 45,282 = 2,207 + 17,367
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
45,282 ÷ 17,367 = 2 + 10,548
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
17,367 ÷ 10,548 = 1 + 6,819
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
10,548 ÷ 6,819 = 1 + 3,729
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,819 ÷ 3,729 = 1 + 3,090
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
3,729 ÷ 3,090 = 1 + 639
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,090 ÷ 639 = 4 + 534
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
639 ÷ 534 = 1 + 105
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
534 ÷ 105 = 5 + 9
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
105 ÷ 9 = 11 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
9 ÷ 6 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 3 = 2 + 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,718) = 3
The two numbers have common prime factors