Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,282; 200,000,000,146) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,282 = 2 × 50,000,141
100,000,282 is not a prime number but a composite one.
200,000,000,146 = 2 × 100,000,000,073
200,000,000,146 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,146 ÷ 100,000,282 = 1,999 + 99,436,428
Step 2. Divide the smaller number by the above operation's remainder:
100,000,282 ÷ 99,436,428 = 1 + 563,854
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,436,428 ÷ 563,854 = 176 + 198,124
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
563,854 ÷ 198,124 = 2 + 167,606
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
198,124 ÷ 167,606 = 1 + 30,518
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
167,606 ÷ 30,518 = 5 + 15,016
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
30,518 ÷ 15,016 = 2 + 486
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
15,016 ÷ 486 = 30 + 436
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
486 ÷ 436 = 1 + 50
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
436 ÷ 50 = 8 + 36
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
50 ÷ 36 = 1 + 14
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
36 ÷ 14 = 2 + 8
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
14 ÷ 8 = 1 + 6
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
8 ÷ 6 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
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,282; 200,000,000,146) = 2
The two numbers have common prime factors