What is the Greatest Common Factor of 15481 and 15496?

Greatest common factor (GCF) of 15481 and 15496 is 1.

GCF(15481,15496) = 1

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

How to find the GCF of 15481 and 15496?

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

Step-1: Prime Factorization of 15481

Prime factors of 15481 are 113, 137. Prime factorization of 15481 in exponential form is:

15481 = 113¹ × 137¹

Step-2: Prime Factorization of 15496

Prime factors of 15496 are 2, 13, 149. Prime factorization of 15496 in exponential form is:

15496 = 2³ × 13¹ × 149¹

Step-3: Factors of 15481

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

1, 113, 137

Step-4: Factors of 15496

List of positive integer factors of 15496 that divides 15481 without a remainder.

1, 2, 4, 8, 13, 26, 52, 104, 149, 298, 596, 1192, 1937, 3874, 7748

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15481 and 15496