GCD of 397, 549, 245 Calculator

Given Input numbers are 397, 549, 245

To find the GCD of numbers using factoring list out all the divisors of each number

Divisors of 397

List of positive integer divisors of 397 that divides 397 without a remainder.

1, 397

Divisors of 549

List of positive integer divisors of 549 that divides 549 without a remainder.

1, 3, 9, 61, 183, 549

Divisors of 245

List of positive integer divisors of 245 that divides 245 without a remainder.

1, 5, 7, 35, 49, 245

Greatest Common Divisior

We found the divisors of 397, 549, 245 . The biggest common divisior number is the GCD number.
So the Greatest Common Divisior 397, 549, 245 is 1.

Therefore, GCD of numbers 397, 549, 245 is 1

Given Input Data is 397, 549, 245

Make a list of Prime Factors of all the given numbers initially

Prime Factorization of 397 is 397

Prime Factorization of 549 is 3 x 3 x 61

Prime Factorization of 245 is 5 x 7 x 7

The above numbers do not have any common prime factor. So GCD is 1

Step1:

Let's calculate the GCD of first two numbers

The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)

LCM(397, 549) = 217953

GCD(397, 549) = ( 397 x 549 ) / 217953

GCD(397, 549) = 217953 / 217953

GCD(397, 549) = 1

Step2:

Here we consider the GCD from the above i.e. 1 as first number and the next as 245

The formula of GCD is GCD(a, b) = ( a x b) / LCM(a, b)

LCM(1, 245) = 245

GCD(1, 245) = ( 1 x 245 ) / 245

GCD(1, 245) = 245 / 245

GCD(1, 245) = 1

GCD of 397, 549, 245 is 1

Here are some samples of GCD of Numbers calculations.

• GCD of 821, 486, 670
• GCD of 810, 924, 712
• GCD of 731, 705, 325
• GCD of 383, 455, 968
• GCD of 260, 977, 524

1. What is the GCD of 397, 549, 245?

GCD of 397, 549, 245 is 1

2. Where do I get the detailed procedure to find GCD of 397, 549, 245?

You can find a detailed procedure to find GCD of 397, 549, 245 on our page.

3. How to find GCD of 397, 549, 245 on a calculator?

You can find the GCD of 397, 549, 245 by simply giving the inputs separated by commas and click on the calculate button to avail the Greatest Common Divisor in less time.