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

Parity of 395

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

Find out more:

Is 395 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 395 is about 19.875.

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

What is the square number of 395?

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

The square of 395 is 156 025 because 395 × 395 = 3952 = 156 025.

As a consequence, 395 is the square root of 156 025.

Number of digits of 395

395 is a number with 3 digits.

What are the multiples of 395?

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

  • Preceding numbers: …393, 394
  • Following numbers: 396, 397

Nearest numbers from 395

  • Preceding prime number: 389
  • Following prime number: 397
Find out whether some integer is a prime number