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

## Parity of 202

202 is an even number, because it is evenly divisible by 2: 202 / 2 = 101.

Find out more:

## Is 202 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 202 is about 14.213.

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

## What is the square number of 202?

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

The square of 202 is 40 804 because 202 × 202 = 2022 = 40 804.

As a consequence, 202 is the square root of 40 804.

## Number of digits of 202

202 is a number with 3 digits.

## What are the multiples of 202?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 202 too, since 0 × 202 = 0
• 202: indeed, 202 is a multiple of itself, since 202 is evenly divisible by 202 (we have 202 / 202 = 1, so the remainder of this division is indeed zero)
• 404: indeed, 404 = 202 × 2
• 606: indeed, 606 = 202 × 3
• 808: indeed, 808 = 202 × 4
• 1 010: indeed, 1 010 = 202 × 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 202). 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.213). 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 202

• Preceding numbers: …200, 201
• Following numbers: 203, 204

### Nearest numbers from 202

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