Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,248; 200,000,000,200) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,248 = 23 × 3 × 193 × 21,589
100,000,248 is not a prime number but a composite one.
200,000,000,200 = 23 × 52 × 7 × 11 × 13 × 19 × 52,579
200,000,000,200 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,200 ÷ 100,000,248 = 1,999 + 99,504,448
Step 2. Divide the smaller number by the above operation's remainder:
100,000,248 ÷ 99,504,448 = 1 + 495,800
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,504,448 ÷ 495,800 = 200 + 344,448
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
495,800 ÷ 344,448 = 1 + 151,352
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
344,448 ÷ 151,352 = 2 + 41,744
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
151,352 ÷ 41,744 = 3 + 26,120
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
41,744 ÷ 26,120 = 1 + 15,624
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
26,120 ÷ 15,624 = 1 + 10,496
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
15,624 ÷ 10,496 = 1 + 5,128
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
10,496 ÷ 5,128 = 2 + 240
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
5,128 ÷ 240 = 21 + 88
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
240 ÷ 88 = 2 + 64
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
88 ÷ 64 = 1 + 24
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
64 ÷ 24 = 2 + 16
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
24 ÷ 16 = 1 + 8
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
16 ÷ 8 = 2 + 0
At this step, the remainder is zero, so we stop:
8 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,248; 200,000,000,200) = 8 = 23
The two numbers have common prime factors