Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,902; 200,000,000,162) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,902 = 2 × 41 × 857 × 1,423
99,999,902 is not a prime number but a composite one.
200,000,000,162 = 2 × 19 × 3,259 × 1,614,961
200,000,000,162 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,162 ÷ 99,999,902 = 2,000 + 196,162
Step 2. Divide the smaller number by the above operation's remainder:
99,999,902 ÷ 196,162 = 509 + 153,444
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
196,162 ÷ 153,444 = 1 + 42,718
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
153,444 ÷ 42,718 = 3 + 25,290
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
42,718 ÷ 25,290 = 1 + 17,428
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
25,290 ÷ 17,428 = 1 + 7,862
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,428 ÷ 7,862 = 2 + 1,704
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,862 ÷ 1,704 = 4 + 1,046
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,704 ÷ 1,046 = 1 + 658
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,046 ÷ 658 = 1 + 388
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
658 ÷ 388 = 1 + 270
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
388 ÷ 270 = 1 + 118
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
270 ÷ 118 = 2 + 34
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
118 ÷ 34 = 3 + 16
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
34 ÷ 16 = 2 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
16 ÷ 2 = 8 + 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 (99,999,902; 200,000,000,162) = 2
The two numbers have common prime factors