Is 273 a prime number? What are the divisors of 273?

Parity of 273

273 is an odd number, because it is not evenly divisible by 2.

Find out more:

Is 273 a perfect square number?

A number is a perfect square (or a square number) if its square root is an integer; that is to say, it is the product of an integer with itself. Here, the square root of 273 is about 16.523.

Thus, the square root of 273 is not an integer, and therefore 273 is not a square number.

What is the square number of 273?

The square of a number (here 273) is the result of the product of this number (273) by itself (i.e., 273 × 273); the square of 273 is sometimes called "raising 273 to the power 2", or "273 squared".

The square of 273 is 74 529 because 273 × 273 = 2732 = 74 529.

As a consequence, 273 is the square root of 74 529.

Number of digits of 273

273 is a number with 3 digits.

What are the multiples of 273?

The multiples of 273 are all integers evenly divisible by 273, that is all numbers such that the remainder of the division by 273 is zero. There are infinitely many multiples of 273. The smallest multiples of 273 are:

How to determine whether an integer is a prime number?

To determine the primality of a number, several algorithms can be used. The most naive technique is to test all divisors strictly smaller to the number of which we want to determine the primality (here 273). First, we can eliminate all even numbers greater than 2 (and hence 4, 6, 8…). Then, we can stop this check when we reach the square root of the number of which we want to determine the primality (here the square root is about 16.523). Historically, the sieve of Eratosthenes (dating from the Greek mathematics) implements this technique in a relatively efficient manner.

More modern techniques include the sieve of Atkin, probabilistic algorithms, and the cyclotomic AKS test.

Numbers near 273

  • Preceding numbers: …271, 272
  • Following numbers: 274, 275

Nearest numbers from 273

  • Preceding prime number: 271
  • Following prime number: 277
Find out whether some integer is a prime number