Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (100,000,065; 200,000,000,235) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
100,000,065 = 3 × 5 × 11 × 331 × 1,831
100,000,065 is not a prime number but a composite one.
200,000,000,235 = 3 × 5 × 7 × 1,904,761,907
200,000,000,235 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,235 ÷ 100,000,065 = 1,999 + 99,870,300
Step 2. Divide the smaller number by the above operation's remainder:
100,000,065 ÷ 99,870,300 = 1 + 129,765
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
99,870,300 ÷ 129,765 = 769 + 81,015
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
129,765 ÷ 81,015 = 1 + 48,750
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
81,015 ÷ 48,750 = 1 + 32,265
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
48,750 ÷ 32,265 = 1 + 16,485
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
32,265 ÷ 16,485 = 1 + 15,780
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
16,485 ÷ 15,780 = 1 + 705
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
15,780 ÷ 705 = 22 + 270
Step 10. Divide the remainder of the step 8 by the remainder of the step 9:
705 ÷ 270 = 2 + 165
Step 11. Divide the remainder of the step 9 by the remainder of the step 10:
270 ÷ 165 = 1 + 105
Step 12. Divide the remainder of the step 10 by the remainder of the step 11:
165 ÷ 105 = 1 + 60
Step 13. Divide the remainder of the step 11 by the remainder of the step 12:
105 ÷ 60 = 1 + 45
Step 14. Divide the remainder of the step 12 by the remainder of the step 13:
60 ÷ 45 = 1 + 15
Step 15. Divide the remainder of the step 13 by the remainder of the step 14:
45 ÷ 15 = 3 + 0
At this step, the remainder is zero, so we stop:
15 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,065; 200,000,000,235) = 15 = 3 × 5
The two numbers have common prime factors