Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,010; 200,000,000,395) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,010 = 2 × 5 × 11 × 909,091
100,000,010 is not a prime number but a composite one.
200,000,000,395 = 5 × 132 × 4,637 × 51,043
200,000,000,395 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,395 ÷ 100,000,010 = 1,999 + 99,980,405
Step 2. Divide the smaller number by the above operation's remainder:
100,000,010 ÷ 99,980,405 = 1 + 19,605
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,980,405 ÷ 19,605 = 5,099 + 14,510
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
19,605 ÷ 14,510 = 1 + 5,095
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
14,510 ÷ 5,095 = 2 + 4,320
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
5,095 ÷ 4,320 = 1 + 775
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
4,320 ÷ 775 = 5 + 445
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
775 ÷ 445 = 1 + 330
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
445 ÷ 330 = 1 + 115
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
330 ÷ 115 = 2 + 100
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
115 ÷ 100 = 1 + 15
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
100 ÷ 15 = 6 + 10
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
15 ÷ 10 = 1 + 5
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
10 ÷ 5 = 2 + 0
At this step, the remainder is zero, so we stop:
5 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,010; 200,000,000,395) = 5
The two numbers have common prime factors