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

## Parity of 203

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

Find out more:

## Is 203 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 203 is about 14.248.

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

## What is the square number of 203?

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

The square of 203 is 41 209 because 203 × 203 = 2032 = 41 209.

As a consequence, 203 is the square root of 41 209.

## Number of digits of 203

203 is a number with 3 digits.

## What are the multiples of 203?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 203 too, since 0 × 203 = 0
• 203: indeed, 203 is a multiple of itself, since 203 is evenly divisible by 203 (we have 203 / 203 = 1, so the remainder of this division is indeed zero)
• 406: indeed, 406 = 203 × 2
• 609: indeed, 609 = 203 × 3
• 812: indeed, 812 = 203 × 4
• 1 015: indeed, 1 015 = 203 × 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 203). 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.248). 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 203

• Preceding numbers: …201, 202
• Following numbers: 204, 205

### Nearest numbers from 203

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