Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (10,384; 29,460) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
10,384 = 24 × 11 × 59
10,384 is not a prime number but a composite one.
29,460 = 22 × 3 × 5 × 491
29,460 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:
29,460 ÷ 10,384 = 2 + 8,692
Step 2. Divide the smaller number by the above operation's remainder:
10,384 ÷ 8,692 = 1 + 1,692
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
8,692 ÷ 1,692 = 5 + 232
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
1,692 ÷ 232 = 7 + 68
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
232 ÷ 68 = 3 + 28
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
68 ÷ 28 = 2 + 12
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
28 ÷ 12 = 2 + 4
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
12 ÷ 4 = 3 + 0
At this step, the remainder is zero, so we stop:
4 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 (10,384; 29,460) = 4 = 22
The two numbers have common prime factors