Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,118; 200,000,000,452) = ?
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,000,452 = 22 × 7 × 61 × 3,001 × 39,019
200,000,000,452 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,452 ÷ 100,000,118 = 1,999 + 99,764,570
Step 2. Divide the smaller number by the above operation's remainder:
100,000,118 ÷ 99,764,570 = 1 + 235,548
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,764,570 ÷ 235,548 = 423 + 127,766
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
235,548 ÷ 127,766 = 1 + 107,782
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
127,766 ÷ 107,782 = 1 + 19,984
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
107,782 ÷ 19,984 = 5 + 7,862
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
19,984 ÷ 7,862 = 2 + 4,260
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,862 ÷ 4,260 = 1 + 3,602
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
4,260 ÷ 3,602 = 1 + 658
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,602 ÷ 658 = 5 + 312
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
658 ÷ 312 = 2 + 34
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
312 ÷ 34 = 9 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
34 ÷ 6 = 5 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 4 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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,000,452) = 2
The two numbers have common prime factors