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

Parity of 385

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

Find out more:

Is 385 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 385 is about 19.621.

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

What is the square number of 385?

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

The square of 385 is 148 225 because 385 × 385 = 3852 = 148 225.

As a consequence, 385 is the square root of 148 225.

Number of digits of 385

385 is a number with 3 digits.

What are the multiples of 385?

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

  • Preceding numbers: …383, 384
  • Following numbers: 386, 387

Nearest numbers from 385

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