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

Parity of 939

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

Find out more:

Is 939 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 939 is about 30.643.

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

What is the square number of 939?

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

The square of 939 is 881 721 because 939 × 939 = 9392 = 881 721.

As a consequence, 939 is the square root of 881 721.

Number of digits of 939

939 is a number with 3 digits.

What are the multiples of 939?

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

  • Preceding numbers: …937, 938
  • Following numbers: 940, 941

Nearest numbers from 939

  • Preceding prime number: 937
  • Following prime number: 941
Find out whether some integer is a prime number