Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,084; 200,000,000,946) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,084 = 22 × 271 × 92,251
100,000,084 is not a prime number but a composite one.
200,000,000,946 = 2 × 3 × 17 × 103 × 109 × 174,649
200,000,000,946 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,946 ÷ 100,000,084 = 1,999 + 99,833,030
Step 2. Divide the smaller number by the above operation's remainder:
100,000,084 ÷ 99,833,030 = 1 + 167,054
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,833,030 ÷ 167,054 = 597 + 101,792
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
167,054 ÷ 101,792 = 1 + 65,262
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
101,792 ÷ 65,262 = 1 + 36,530
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
65,262 ÷ 36,530 = 1 + 28,732
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
36,530 ÷ 28,732 = 1 + 7,798
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
28,732 ÷ 7,798 = 3 + 5,338
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
7,798 ÷ 5,338 = 1 + 2,460
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
5,338 ÷ 2,460 = 2 + 418
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
2,460 ÷ 418 = 5 + 370
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
418 ÷ 370 = 1 + 48
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
370 ÷ 48 = 7 + 34
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
48 ÷ 34 = 1 + 14
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
34 ÷ 14 = 2 + 6
Step 16. Divide the remainder of the step 14 by the remainder of the step 15:
14 ÷ 6 = 2 + 2
Step 17. Divide the remainder of the step 15 by the remainder of the step 16:
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,084; 200,000,000,946) = 2
The two numbers have common prime factors