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

## Parity of 116

116 is an even number, because it is evenly divisible by 2: 116 / 2 = 58.

Find out more:

## Is 116 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 116 is about 10.770.

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

## What is the square number of 116?

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

The square of 116 is 13 456 because 116 × 116 = 1162 = 13 456.

As a consequence, 116 is the square root of 13 456.

## Number of digits of 116

116 is a number with 3 digits.

## What are the multiples of 116?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 116 too, since 0 × 116 = 0
• 116: indeed, 116 is a multiple of itself, since 116 is evenly divisible by 116 (we have 116 / 116 = 1, so the remainder of this division is indeed zero)
• 232: indeed, 232 = 116 × 2
• 348: indeed, 348 = 116 × 3
• 464: indeed, 464 = 116 × 4
• 580: indeed, 580 = 116 × 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 116). 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.770). 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 116

• Preceding numbers: …114, 115
• Following numbers: 117, 118

### Nearest numbers from 116

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