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

## Parity of 210

210 is an even number, because it is evenly divisible by 2: 210 / 2 = 105.

Find out more:

## Is 210 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 210 is about 14.491.

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

## What is the square number of 210?

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

The square of 210 is 44 100 because 210 × 210 = 2102 = 44 100.

As a consequence, 210 is the square root of 44 100.

## Number of digits of 210

210 is a number with 3 digits.

## What are the multiples of 210?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 210 too, since 0 × 210 = 0
• 210: indeed, 210 is a multiple of itself, since 210 is evenly divisible by 210 (we have 210 / 210 = 1, so the remainder of this division is indeed zero)
• 420: indeed, 420 = 210 × 2
• 630: indeed, 630 = 210 × 3
• 840: indeed, 840 = 210 × 4
• 1 050: indeed, 1 050 = 210 × 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 210). 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 14.491). 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 210

• Preceding numbers: …208, 209
• Following numbers: 211, 212

### Nearest numbers from 210

• Preceding prime number: 199
• Following prime number: 211
Find out whether some integer is a prime number