Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,143; 200,000,000,535) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,143 = 33 × 83 × 44,623
100,000,143 is not a prime number but a composite one.
200,000,000,535 = 3 × 5 × 13,333,333,369
200,000,000,535 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,535 ÷ 100,000,143 = 1,999 + 99,714,678
Step 2. Divide the smaller number by the above operation's remainder:
100,000,143 ÷ 99,714,678 = 1 + 285,465
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,714,678 ÷ 285,465 = 349 + 87,393
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
285,465 ÷ 87,393 = 3 + 23,286
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
87,393 ÷ 23,286 = 3 + 17,535
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
23,286 ÷ 17,535 = 1 + 5,751
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
17,535 ÷ 5,751 = 3 + 282
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,751 ÷ 282 = 20 + 111
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
282 ÷ 111 = 2 + 60
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
111 ÷ 60 = 1 + 51
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
60 ÷ 51 = 1 + 9
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
51 ÷ 9 = 5 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
9 ÷ 6 = 1 + 3
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 3 = 2 + 0
At this step, the remainder is zero, so we stop:
3 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,143; 200,000,000,535) = 3
The two numbers have common prime factors