Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,064; 200,000,000,922) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,064 = 26 × 1,201 × 1,301
100,000,064 is not a prime number but a composite one.
200,000,000,922 = 2 × 3 × 19 × 23 × 5,573 × 13,687
200,000,000,922 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,922 ÷ 100,000,064 = 1,999 + 99,872,986
Step 2. Divide the smaller number by the above operation's remainder:
100,000,064 ÷ 99,872,986 = 1 + 127,078
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,872,986 ÷ 127,078 = 785 + 116,756
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
127,078 ÷ 116,756 = 1 + 10,322
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
116,756 ÷ 10,322 = 11 + 3,214
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
10,322 ÷ 3,214 = 3 + 680
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
3,214 ÷ 680 = 4 + 494
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
680 ÷ 494 = 1 + 186
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
494 ÷ 186 = 2 + 122
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
186 ÷ 122 = 1 + 64
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
122 ÷ 64 = 1 + 58
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
64 ÷ 58 = 1 + 6
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
58 ÷ 6 = 9 + 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,064; 200,000,000,922) = 2
The two numbers have common prime factors