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

## Parity of 236

236 is an even number, because it is evenly divisible by 2: 236 / 2 = 118.

Find out more:

## Is 236 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 236 is about 15.362.

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

## What is the square number of 236?

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

The square of 236 is 55 696 because 236 × 236 = 2362 = 55 696.

As a consequence, 236 is the square root of 55 696.

## Number of digits of 236

236 is a number with 3 digits.

## What are the multiples of 236?

The multiples of 236 are all integers evenly divisible by 236, that is all numbers such that the remainder of the division by 236 is zero. There are infinitely many multiples of 236. The smallest multiples of 236 are:

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 236 too, since 0 × 236 = 0
• 236: indeed, 236 is a multiple of itself, since 236 is evenly divisible by 236 (we have 236 / 236 = 1, so the remainder of this division is indeed zero)
• 472: indeed, 472 = 236 × 2
• 708: indeed, 708 = 236 × 3
• 944: indeed, 944 = 236 × 4
• 1 180: indeed, 1 180 = 236 × 5
• etc.

## 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 236). 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 15.362). 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 236

• Preceding numbers: …234, 235
• Following numbers: 237, 238

### Nearest numbers from 236

• Preceding prime number: 233
• Following prime number: 239
Find out whether some integer is a prime number