Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,156; 200,000,000,802) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,156 = 22 × 751 × 33,289
100,000,156 is not a prime number but a composite one.
200,000,000,802 = 2 × 3 × 7 × 47 × 107 × 241 × 3,929
200,000,000,802 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,802 ÷ 100,000,156 = 1,999 + 99,688,958
Step 2. Divide the smaller number by the above operation's remainder:
100,000,156 ÷ 99,688,958 = 1 + 311,198
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,688,958 ÷ 311,198 = 320 + 105,598
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
311,198 ÷ 105,598 = 2 + 100,002
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
105,598 ÷ 100,002 = 1 + 5,596
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
100,002 ÷ 5,596 = 17 + 4,870
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
5,596 ÷ 4,870 = 1 + 726
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
4,870 ÷ 726 = 6 + 514
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
726 ÷ 514 = 1 + 212
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
514 ÷ 212 = 2 + 90
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
212 ÷ 90 = 2 + 32
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
90 ÷ 32 = 2 + 26
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
32 ÷ 26 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
26 ÷ 6 = 4 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
6 ÷ 2 = 3 + 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,156; 200,000,000,802) = 2
The two numbers have common prime factors