What is the Greatest Common Factor of 65465 and 65481?

Greatest common factor (GCF) of 65465 and 65481 is 1.

GCF(65465,65481) = 1

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

How to find the GCF of 65465 and 65481?

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

Step-1: Prime Factorization of 65465

Prime factors of 65465 are 5, 13093. Prime factorization of 65465 in exponential form is:

65465 = 5¹ × 13093¹

Step-2: Prime Factorization of 65481

Prime factors of 65481 are 3, 13, 23, 73. Prime factorization of 65481 in exponential form is:

65481 = 3¹ × 13¹ × 23¹ × 73¹

Step-3: Factors of 65465

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

1, 5, 13093

Step-4: Factors of 65481

List of positive integer factors of 65481 that divides 65465 without a remainder.

1, 3, 13, 23, 39, 69, 73, 219, 299, 897, 949, 1679, 2847, 5037, 21827

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 65465 and 65481