Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (99,999,978; 200,000,000,448) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
99,999,978 = 2 × 3 × 13 × 1,282,051
99,999,978 is not a prime number but a composite one.
200,000,000,448 = 26 × 34 × 38,580,247
200,000,000,448 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,448 ÷ 99,999,978 = 2,000 + 44,448
Step 2. Divide the smaller number by the above operation's remainder:
99,999,978 ÷ 44,448 = 2,249 + 36,426
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
44,448 ÷ 36,426 = 1 + 8,022
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
36,426 ÷ 8,022 = 4 + 4,338
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
8,022 ÷ 4,338 = 1 + 3,684
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
4,338 ÷ 3,684 = 1 + 654
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,684 ÷ 654 = 5 + 414
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
654 ÷ 414 = 1 + 240
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
414 ÷ 240 = 1 + 174
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
240 ÷ 174 = 1 + 66
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
174 ÷ 66 = 2 + 42
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
66 ÷ 42 = 1 + 24
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
42 ÷ 24 = 1 + 18
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
24 ÷ 18 = 1 + 6
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
18 ÷ 6 = 3 + 0
At this step, the remainder is zero, so we stop:
6 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,978; 200,000,000,448) = 6 = 2 × 3
The two numbers have common prime factors