Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,083; 200,000,000,508) = ?
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,508 = 22 × 3 × 7 × 11 × 23 × 9,410,879
200,000,000,508 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,508 ÷ 100,000,083 = 1,999 + 99,834,591
Step 2. Divide the smaller number by the above operation's remainder:
100,000,083 ÷ 99,834,591 = 1 + 165,492
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,834,591 ÷ 165,492 = 603 + 42,915
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
165,492 ÷ 42,915 = 3 + 36,747
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
42,915 ÷ 36,747 = 1 + 6,168
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
36,747 ÷ 6,168 = 5 + 5,907
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
6,168 ÷ 5,907 = 1 + 261
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
5,907 ÷ 261 = 22 + 165
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
261 ÷ 165 = 1 + 96
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
165 ÷ 96 = 1 + 69
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
96 ÷ 69 = 1 + 27
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
69 ÷ 27 = 2 + 15
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
27 ÷ 15 = 1 + 12
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
15 ÷ 12 = 1 + 3
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
12 ÷ 3 = 4 + 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,508) = 3
The two numbers have common prime factors