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

## Parity of 112

112 is an even number, because it is evenly divisible by 2: 112 / 2 = 56.

Find out more:

## Is 112 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 112 is about 10.583.

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

## What is the square number of 112?

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

The square of 112 is 12 544 because 112 × 112 = 1122 = 12 544.

As a consequence, 112 is the square root of 12 544.

## Number of digits of 112

112 is a number with 3 digits.

## What are the multiples of 112?

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

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

• Preceding numbers: …110, 111
• Following numbers: 113, 114

### Nearest numbers from 112

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