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

Parity of 381

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

Find out more:

Is 381 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 381 is about 19.519.

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

What is the square number of 381?

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

The square of 381 is 145 161 because 381 × 381 = 3812 = 145 161.

As a consequence, 381 is the square root of 145 161.

Number of digits of 381

381 is a number with 3 digits.

What are the multiples of 381?

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

  • Preceding numbers: …379, 380
  • Following numbers: 382, 383

Nearest numbers from 381

  • Preceding prime number: 379
  • Following prime number: 383
Find out whether some integer is a prime number