Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,070; 200,000,000,766) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,070 = 2 × 5 × 941 × 10,627
100,000,070 is not a prime number but a composite one.
200,000,000,766 = 2 × 3 × 97 × 233 × 1,474,861
200,000,000,766 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,766 ÷ 100,000,070 = 1,999 + 99,860,836
Step 2. Divide the smaller number by the above operation's remainder:
100,000,070 ÷ 99,860,836 = 1 + 139,234
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,860,836 ÷ 139,234 = 717 + 30,058
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
139,234 ÷ 30,058 = 4 + 19,002
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
30,058 ÷ 19,002 = 1 + 11,056
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
19,002 ÷ 11,056 = 1 + 7,946
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
11,056 ÷ 7,946 = 1 + 3,110
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,946 ÷ 3,110 = 2 + 1,726
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
3,110 ÷ 1,726 = 1 + 1,384
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,726 ÷ 1,384 = 1 + 342
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
1,384 ÷ 342 = 4 + 16
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
342 ÷ 16 = 21 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
16 ÷ 6 = 2 + 4
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
6 ÷ 4 = 1 + 2
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
4 ÷ 2 = 2 + 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,070; 200,000,000,766) = 2
The two numbers have common prime factors