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

## Parity of 171

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

Find out more:

## Is 171 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 171 is about 13.077.

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

## What is the square number of 171?

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

The square of 171 is 29 241 because 171 × 171 = 1712 = 29 241.

As a consequence, 171 is the square root of 29 241.

## Number of digits of 171

171 is a number with 3 digits.

## What are the multiples of 171?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 171 too, since 0 × 171 = 0
• 171: indeed, 171 is a multiple of itself, since 171 is evenly divisible by 171 (we have 171 / 171 = 1, so the remainder of this division is indeed zero)
• 342: indeed, 342 = 171 × 2
• 513: indeed, 513 = 171 × 3
• 684: indeed, 684 = 171 × 4
• 855: indeed, 855 = 171 × 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 171). 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 13.077). 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 171

• Preceding numbers: …169, 170
• Following numbers: 172, 173

### Nearest numbers from 171

• Preceding prime number: 167
• Following prime number: 173
Find out whether some integer is a prime number