Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,088; 200,000,000,906) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,088 = 23 × 109 × 114,679
100,000,088 is not a prime number but a composite one.
200,000,000,906 = 2 × 701 × 142,653,353
200,000,000,906 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,906 ÷ 100,000,088 = 1,999 + 99,824,994
Step 2. Divide the smaller number by the above operation's remainder:
100,000,088 ÷ 99,824,994 = 1 + 175,094
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,824,994 ÷ 175,094 = 570 + 21,414
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
175,094 ÷ 21,414 = 8 + 3,782
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
21,414 ÷ 3,782 = 5 + 2,504
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
3,782 ÷ 2,504 = 1 + 1,278
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
2,504 ÷ 1,278 = 1 + 1,226
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
1,278 ÷ 1,226 = 1 + 52
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,226 ÷ 52 = 23 + 30
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
52 ÷ 30 = 1 + 22
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
30 ÷ 22 = 1 + 8
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
22 ÷ 8 = 2 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
8 ÷ 6 = 1 + 2
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
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,088; 200,000,000,906) = 2
The two numbers have common prime factors