Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,118; 200,000,001,010) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,118 = 2 × 50,000,059
100,000,118 is not a prime number but a composite one.
200,000,001,010 = 2 × 5 × 173 × 115,606,937
200,000,001,010 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,001,010 ÷ 100,000,118 = 1,999 + 99,765,128
Step 2. Divide the smaller number by the above operation's remainder:
100,000,118 ÷ 99,765,128 = 1 + 234,990
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,765,128 ÷ 234,990 = 424 + 129,368
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
234,990 ÷ 129,368 = 1 + 105,622
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
129,368 ÷ 105,622 = 1 + 23,746
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
105,622 ÷ 23,746 = 4 + 10,638
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
23,746 ÷ 10,638 = 2 + 2,470
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
10,638 ÷ 2,470 = 4 + 758
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,470 ÷ 758 = 3 + 196
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
758 ÷ 196 = 3 + 170
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
196 ÷ 170 = 1 + 26
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
170 ÷ 26 = 6 + 14
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
26 ÷ 14 = 1 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
14 ÷ 12 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 2 = 6 + 0
At this step, the remainder is zero, so we stop:
2 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,118; 200,000,001,010) = 2
The two numbers have common prime factors