Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,078; 200,000,000,368) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,078 = 2 × 19 × 2,631,581
100,000,078 is not a prime number but a composite one.
200,000,000,368 = 24 × 7 × 17 × 105,042,017
200,000,000,368 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,368 ÷ 100,000,078 = 1,999 + 99,844,446
Step 2. Divide the smaller number by the above operation's remainder:
100,000,078 ÷ 99,844,446 = 1 + 155,632
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,844,446 ÷ 155,632 = 641 + 84,334
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
155,632 ÷ 84,334 = 1 + 71,298
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
84,334 ÷ 71,298 = 1 + 13,036
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
71,298 ÷ 13,036 = 5 + 6,118
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
13,036 ÷ 6,118 = 2 + 800
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,118 ÷ 800 = 7 + 518
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
800 ÷ 518 = 1 + 282
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
518 ÷ 282 = 1 + 236
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
282 ÷ 236 = 1 + 46
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
236 ÷ 46 = 5 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
46 ÷ 6 = 7 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 4 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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,078; 200,000,000,368) = 2
The two numbers have common prime factors