Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (9,688; 294,768) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
9,688 = 23 × 7 × 173
9,688 is not a prime number but a composite one.
294,768 = 24 × 32 × 23 × 89
294,768 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:
294,768 ÷ 9,688 = 30 + 4,128
Step 2. Divide the smaller number by the above operation's remainder:
9,688 ÷ 4,128 = 2 + 1,432
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
4,128 ÷ 1,432 = 2 + 1,264
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,432 ÷ 1,264 = 1 + 168
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
1,264 ÷ 168 = 7 + 88
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
168 ÷ 88 = 1 + 80
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
88 ÷ 80 = 1 + 8
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
80 ÷ 8 = 10 + 0
At this step, the remainder is zero, so we stop:
8 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 (9,688; 294,768) = 8 = 23
The two numbers have common prime factors