Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,083; 200,000,000,235) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,083 = 3 × 227 × 146,843
100,000,083 is not a prime number but a composite one.
200,000,000,235 = 3 × 5 × 7 × 1,904,761,907
200,000,000,235 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,235 ÷ 100,000,083 = 1,999 + 99,834,318
Step 2. Divide the smaller number by the above operation's remainder:
100,000,083 ÷ 99,834,318 = 1 + 165,765
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,834,318 ÷ 165,765 = 602 + 43,788
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
165,765 ÷ 43,788 = 3 + 34,401
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
43,788 ÷ 34,401 = 1 + 9,387
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
34,401 ÷ 9,387 = 3 + 6,240
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,387 ÷ 6,240 = 1 + 3,147
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
6,240 ÷ 3,147 = 1 + 3,093
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,147 ÷ 3,093 = 1 + 54
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
3,093 ÷ 54 = 57 + 15
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
54 ÷ 15 = 3 + 9
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
15 ÷ 9 = 1 + 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,083; 200,000,000,235) = 3
The two numbers have common prime factors