Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (27,496; 5,971) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
27,496 = 23 × 7 × 491
27,496 is not a prime number but a composite one.
5,971 = 7 × 853
5,971 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:
27,496 ÷ 5,971 = 4 + 3,612
Step 2. Divide the smaller number by the above operation's remainder:
5,971 ÷ 3,612 = 1 + 2,359
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
3,612 ÷ 2,359 = 1 + 1,253
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
2,359 ÷ 1,253 = 1 + 1,106
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
1,253 ÷ 1,106 = 1 + 147
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
1,106 ÷ 147 = 7 + 77
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
147 ÷ 77 = 1 + 70
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
77 ÷ 70 = 1 + 7
Step 9. Divide the remainder of the step 7 by the remainder of the step 8:
70 ÷ 7 = 10 + 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 (27,496; 5,971) = 7
The two numbers have common prime factors