Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,023; 200,000,000,676) = ?
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,676 = 22 × 3 × 7 × 2,380,952,389
200,000,000,676 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,676 ÷ 100,000,023 = 1,999 + 99,954,699
Step 2. Divide the smaller number by the above operation's remainder:
100,000,023 ÷ 99,954,699 = 1 + 45,324
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,954,699 ÷ 45,324 = 2,205 + 15,279
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
45,324 ÷ 15,279 = 2 + 14,766
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
15,279 ÷ 14,766 = 1 + 513
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
14,766 ÷ 513 = 28 + 402
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
513 ÷ 402 = 1 + 111
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
402 ÷ 111 = 3 + 69
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
111 ÷ 69 = 1 + 42
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
69 ÷ 42 = 1 + 27
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
42 ÷ 27 = 1 + 15
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
27 ÷ 15 = 1 + 12
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
15 ÷ 12 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
12 ÷ 3 = 4 + 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,676) = 3
The two numbers have common prime factors