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

## Parity of 143

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

Find out more:

## Is 143 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 143 is about 11.958.

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

## What is the square number of 143?

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

The square of 143 is 20 449 because 143 × 143 = 1432 = 20 449.

As a consequence, 143 is the square root of 20 449.

## Number of digits of 143

143 is a number with 3 digits.

## What are the multiples of 143?

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

• 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 143 too, since 0 × 143 = 0
• 143: indeed, 143 is a multiple of itself, since 143 is evenly divisible by 143 (we have 143 / 143 = 1, so the remainder of this division is indeed zero)
• 286: indeed, 286 = 143 × 2
• 429: indeed, 429 = 143 × 3
• 572: indeed, 572 = 143 × 4
• 715: indeed, 715 = 143 × 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 143). 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 11.958). 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 143

• Preceding numbers: …141, 142
• Following numbers: 144, 145

### Nearest numbers from 143

• Preceding prime number: 139
• Following prime number: 149
Find out whether some integer is a prime number