Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,023; 200,000,000,196) = ?
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,196 = 22 × 32 × 383 × 14,505,367
200,000,000,196 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,196 ÷ 100,000,023 = 1,999 + 99,954,219
Step 2. Divide the smaller number by the above operation's remainder:
100,000,023 ÷ 99,954,219 = 1 + 45,804
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,954,219 ÷ 45,804 = 2,182 + 9,891
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
45,804 ÷ 9,891 = 4 + 6,240
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
9,891 ÷ 6,240 = 1 + 3,651
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
6,240 ÷ 3,651 = 1 + 2,589
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,651 ÷ 2,589 = 1 + 1,062
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
2,589 ÷ 1,062 = 2 + 465
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,062 ÷ 465 = 2 + 132
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
465 ÷ 132 = 3 + 69
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
132 ÷ 69 = 1 + 63
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
69 ÷ 63 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
63 ÷ 6 = 10 + 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,196) = 3
The two numbers have common prime factors