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

## Parity of 118

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

Find out more:

## Is 118 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 118 is about 10.863.

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

## What is the square number of 118?

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

The square of 118 is 13 924 because 118 × 118 = 1182 = 13 924.

As a consequence, 118 is the square root of 13 924.

## Number of digits of 118

118 is a number with 3 digits.

## What are the multiples of 118?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 118 too, since 0 × 118 = 0
• 118: indeed, 118 is a multiple of itself, since 118 is evenly divisible by 118 (we have 118 / 118 = 1, so the remainder of this division is indeed zero)
• 236: indeed, 236 = 118 × 2
• 354: indeed, 354 = 118 × 3
• 472: indeed, 472 = 118 × 4
• 590: indeed, 590 = 118 × 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 118). 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 10.863). 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 118

• Preceding numbers: …116, 117
• Following numbers: 119, 120

### Nearest numbers from 118

• Preceding prime number: 113
• Following prime number: 127
Find out whether some integer is a prime number