Calculate the greatest (highest) common factor (divisor)
gcf, hcf, gcd (15,294; 291,161,988) = ?
Method 1. The prime factorization:
The prime factorization of a number: finding the prime numbers that multiply together to make that number.
15,294 = 2 × 3 × 2,549
15,294 is not a prime number but a composite one.
291,161,988 = 22 × 32 × 132 × 47,857
291,161,988 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:
291,161,988 ÷ 15,294 = 19,037 + 10,110
Step 2. Divide the smaller number by the above operation's remainder:
15,294 ÷ 10,110 = 1 + 5,184
Step 3. Divide the remainder of the step 1 by the remainder of the step 2:
10,110 ÷ 5,184 = 1 + 4,926
Step 4. Divide the remainder of the step 2 by the remainder of the step 3:
5,184 ÷ 4,926 = 1 + 258
Step 5. Divide the remainder of the step 3 by the remainder of the step 4:
4,926 ÷ 258 = 19 + 24
Step 6. Divide the remainder of the step 4 by the remainder of the step 5:
258 ÷ 24 = 10 + 18
Step 7. Divide the remainder of the step 5 by the remainder of the step 6:
24 ÷ 18 = 1 + 6
Step 8. Divide the remainder of the step 6 by the remainder of the step 7:
18 ÷ 6 = 3 + 0
At this step, the remainder is zero, so we stop:
6 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 (15,294; 291,161,988) = 6 = 2 × 3
The two numbers have common prime factors