Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,047; 200,000,000,683) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,047 = 3 × 7 × 277 × 17,191
100,000,047 is not a prime number but a composite one.
200,000,000,683 = 73 × 1,861 × 313,321
200,000,000,683 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,683 ÷ 100,000,047 = 1,999 + 99,906,730
Step 2. Divide the smaller number by the above operation's remainder:
100,000,047 ÷ 99,906,730 = 1 + 93,317
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,906,730 ÷ 93,317 = 1,070 + 57,540
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
93,317 ÷ 57,540 = 1 + 35,777
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
57,540 ÷ 35,777 = 1 + 21,763
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
35,777 ÷ 21,763 = 1 + 14,014
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
21,763 ÷ 14,014 = 1 + 7,749
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
14,014 ÷ 7,749 = 1 + 6,265
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
7,749 ÷ 6,265 = 1 + 1,484
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
6,265 ÷ 1,484 = 4 + 329
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,484 ÷ 329 = 4 + 168
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
329 ÷ 168 = 1 + 161
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
168 ÷ 161 = 1 + 7
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
161 ÷ 7 = 23 + 0
At this step, the remainder is zero, so we stop:
7 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,047; 200,000,000,683) = 7
The two numbers have common prime factors