Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,061; 200,000,001,404) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,061 = 7 × 1,601 × 8,923
100,000,061 is not a prime number but a composite one.
200,000,001,404 = 22 × 7 × 7,142,857,193
200,000,001,404 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,001,404 ÷ 100,000,061 = 1,999 + 99,879,465
Step 2. Divide the smaller number by the above operation's remainder:
100,000,061 ÷ 99,879,465 = 1 + 120,596
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,879,465 ÷ 120,596 = 828 + 25,977
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
120,596 ÷ 25,977 = 4 + 16,688
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
25,977 ÷ 16,688 = 1 + 9,289
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
16,688 ÷ 9,289 = 1 + 7,399
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
9,289 ÷ 7,399 = 1 + 1,890
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
7,399 ÷ 1,890 = 3 + 1,729
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
1,890 ÷ 1,729 = 1 + 161
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
1,729 ÷ 161 = 10 + 119
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
161 ÷ 119 = 1 + 42
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
119 ÷ 42 = 2 + 35
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
42 ÷ 35 = 1 + 7
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
35 ÷ 7 = 5 + 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,061; 200,000,001,404) = 7
The two numbers have common prime factors