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

Parity of 369

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

Find out more:

Is 369 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 369 is about 19.209.

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

What is the square number of 369?

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

The square of 369 is 136 161 because 369 × 369 = 3692 = 136 161.

As a consequence, 369 is the square root of 136 161.

Number of digits of 369

369 is a number with 3 digits.

What are the multiples of 369?

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

  • Preceding numbers: …367, 368
  • Following numbers: 370, 371

Nearest numbers from 369

  • Preceding prime number: 367
  • Following prime number: 373
Find out whether some integer is a prime number