What is the Greatest Common Factor of 39481 and 39496?

Greatest common factor (GCF) of 39481 and 39496 is 1.

GCF(39481,39496) = 1

We will now calculate the prime factors of 39481 and 39496, than find the greatest common factor (greatest common divisor (gcd)) of the numbers by matching the biggest common factor of 39481 and 39496.

How to find the GCF of 39481 and 39496?

We will first find the prime factorization of 39481 and 39496. After we will calculate the factors of 39481 and 39496 and find the biggest common factor number .

Step-1: Prime Factorization of 39481

Prime factors of 39481 are 13, 3037. Prime factorization of 39481 in exponential form is:

39481 = 13¹ × 3037¹

Step-2: Prime Factorization of 39496

Prime factors of 39496 are 2, 4937. Prime factorization of 39496 in exponential form is:

39496 = 2³ × 4937¹

Step-3: Factors of 39481

List of positive integer factors of 39481 that divides 39481 without a remainder.

1, 13, 3037

Step-4: Factors of 39496

List of positive integer factors of 39496 that divides 39481 without a remainder.

1, 2, 4, 8, 4937, 9874, 19748

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 39481 and 39496. The biggest common factor number is the GCF number.
So the greatest common factor 39481 and 39496 is 1.

Also check out the Least Common Multiple of 39481 and 39496