Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,046; 200,000,000,280) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,046 = 2 × 67 × 661 × 1,129
100,000,046 is not a prime number but a composite one.
200,000,000,280 = 23 × 3 × 5 × 461 × 3,615,329
200,000,000,280 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,280 ÷ 100,000,046 = 1,999 + 99,908,326
Step 2. Divide the smaller number by the above operation's remainder:
100,000,046 ÷ 99,908,326 = 1 + 91,720
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,908,326 ÷ 91,720 = 1,089 + 25,246
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
91,720 ÷ 25,246 = 3 + 15,982
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
25,246 ÷ 15,982 = 1 + 9,264
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
15,982 ÷ 9,264 = 1 + 6,718
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,264 ÷ 6,718 = 1 + 2,546
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,718 ÷ 2,546 = 2 + 1,626
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
2,546 ÷ 1,626 = 1 + 920
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,626 ÷ 920 = 1 + 706
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
920 ÷ 706 = 1 + 214
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
706 ÷ 214 = 3 + 64
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
214 ÷ 64 = 3 + 22
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
64 ÷ 22 = 2 + 20
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
22 ÷ 20 = 1 + 2
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
20 ÷ 2 = 10 + 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,046; 200,000,000,280) = 2
The two numbers have common prime factors