What is the Greatest Common Factor of 1464 and 1481?

Greatest common factor (GCF) of 1464 and 1481 is 1.

GCF(1464,1481) = 1

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

How to find the GCF of 1464 and 1481?

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

Step-1: Prime Factorization of 1464

Prime factors of 1464 are 2, 3, 61. Prime factorization of 1464 in exponential form is:

1464 = 2³ × 3¹ × 61¹

Step-2: Prime Factorization of 1481

Prime factors of 1481 are 1481. Prime factorization of 1481 in exponential form is:

1481 = 1481¹

Step-3: Factors of 1464

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

1, 2, 3, 4, 6, 8, 12, 24, 61, 122, 183, 244, 366, 488, 732

Step-4: Factors of 1481

List of positive integer factors of 1481 that divides 1464 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1464 and 1481