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

## Parity of 212

212 is an even number, because it is evenly divisible by 2: 212 / 2 = 106.

Find out more:

## Is 212 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 212 is about 14.560.

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

## What is the square number of 212?

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

The square of 212 is 44 944 because 212 × 212 = 2122 = 44 944.

As a consequence, 212 is the square root of 44 944.

## Number of digits of 212

212 is a number with 3 digits.

## What are the multiples of 212?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 212 too, since 0 × 212 = 0
• 212: indeed, 212 is a multiple of itself, since 212 is evenly divisible by 212 (we have 212 / 212 = 1, so the remainder of this division is indeed zero)
• 424: indeed, 424 = 212 × 2
• 636: indeed, 636 = 212 × 3
• 848: indeed, 848 = 212 × 4
• 1 060: indeed, 1 060 = 212 × 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 212). 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.560). 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 212

• Preceding numbers: …210, 211
• Following numbers: 213, 214

### Nearest numbers from 212

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