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

Parity of 893

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

Find out more:

Is 893 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 893 is about 29.883.

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

What is the square number of 893?

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

The square of 893 is 797 449 because 893 × 893 = 8932 = 797 449.

As a consequence, 893 is the square root of 797 449.

Number of digits of 893

893 is a number with 3 digits.

What are the multiples of 893?

The multiples of 893 are all integers evenly divisible by 893, that is all numbers such that the remainder of the division by 893 is zero. There are infinitely many multiples of 893. The smallest multiples of 893 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 893). 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 29.883). 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 893

  • Preceding numbers: …891, 892
  • Following numbers: 894, 895

Nearest numbers from 893

  • Preceding prime number: 887
  • Following prime number: 907
Find out whether some integer is a prime number