What is the Greatest Common Factor of 15953 and 15965?

Greatest common factor (GCF) of 15953 and 15965 is 1.

GCF(15953,15965) = 1

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

How to find the GCF of 15953 and 15965?

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

Step-1: Prime Factorization of 15953

Prime factors of 15953 are 7, 43, 53. Prime factorization of 15953 in exponential form is:

15953 = 7¹ × 43¹ × 53¹

Step-2: Prime Factorization of 15965

Prime factors of 15965 are 5, 31, 103. Prime factorization of 15965 in exponential form is:

15965 = 5¹ × 31¹ × 103¹

Step-3: Factors of 15953

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

1, 7, 43, 53, 301, 371, 2279

Step-4: Factors of 15965

List of positive integer factors of 15965 that divides 15953 without a remainder.

1, 5, 31, 103, 155, 515, 3193

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15953 and 15965