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

## Parity of 92

92 is an even number, because it is evenly divisible by 2: 92 / 2 = 46.

Find out more:

## Is 92 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 92 is about 9.592.

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

## What is the square number of 92?

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

The square of 92 is 8 464 because 92 × 92 = 922 = 8 464.

As a consequence, 92 is the square root of 8 464.

## Number of digits of 92

92 is a number with 2 digits.

## What are the multiples of 92?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 92 too, since 0 × 92 = 0
• 92: indeed, 92 is a multiple of itself, since 92 is evenly divisible by 92 (we have 92 / 92 = 1, so the remainder of this division is indeed zero)
• 184: indeed, 184 = 92 × 2
• 276: indeed, 276 = 92 × 3
• 368: indeed, 368 = 92 × 4
• 460: indeed, 460 = 92 × 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 92). 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 9.592). 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 92

• Preceding numbers: …90, 91
• Following numbers: 93, 94

### Nearest numbers from 92

• Preceding prime number: 89
• Following prime number: 97
Find out whether some integer is a prime number