Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,070; 200,000,000,695) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,070 = 2 × 5 × 941 × 10,627
100,000,070 is not a prime number but a composite one.
200,000,000,695 = 5 × 11 × 107 × 2,897 × 11,731
200,000,000,695 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,695 ÷ 100,000,070 = 1,999 + 99,860,765
Step 2. Divide the smaller number by the above operation's remainder:
100,000,070 ÷ 99,860,765 = 1 + 139,305
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,860,765 ÷ 139,305 = 716 + 118,385
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
139,305 ÷ 118,385 = 1 + 20,920
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
118,385 ÷ 20,920 = 5 + 13,785
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
20,920 ÷ 13,785 = 1 + 7,135
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
13,785 ÷ 7,135 = 1 + 6,650
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,135 ÷ 6,650 = 1 + 485
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
6,650 ÷ 485 = 13 + 345
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
485 ÷ 345 = 1 + 140
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
345 ÷ 140 = 2 + 65
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
140 ÷ 65 = 2 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
65 ÷ 10 = 6 + 5
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 5 = 2 + 0
At this step, the remainder is zero, so we stop:
5 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,070; 200,000,000,695) = 5
The two numbers have common prime factors