Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (59,968; 15,550) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
59,968 = 26 × 937
59,968 is not a prime number but a composite one.
15,550 = 2 × 52 × 311
15,550 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:
59,968 ÷ 15,550 = 3 + 13,318
Step 2. Divide the smaller number by the above operation's remainder:
15,550 ÷ 13,318 = 1 + 2,232
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
13,318 ÷ 2,232 = 5 + 2,158
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
2,232 ÷ 2,158 = 1 + 74
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
2,158 ÷ 74 = 29 + 12
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
74 ÷ 12 = 6 + 2
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
12 ÷ 2 = 6 + 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 (59,968; 15,550) = 2
The two numbers have common prime factors