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

Parity of 102

102 is an even number, because it is evenly divisible by 2: 102 / 2 = 51.

Find out more:

Is 102 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 102 is about 10.100.

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

What is the square number of 102?

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

The square of 102 is 10 404 because 102 × 102 = 1022 = 10 404.

As a consequence, 102 is the square root of 10 404.

Number of digits of 102

102 is a number with 3 digits.

What are the multiples of 102?

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

  • 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 102 too, since 0 × 102 = 0
  • 102: indeed, 102 is a multiple of itself, since 102 is evenly divisible by 102 (we have 102 / 102 = 1, so the remainder of this division is indeed zero)
  • 204: indeed, 204 = 102 × 2
  • 306: indeed, 306 = 102 × 3
  • 408: indeed, 408 = 102 × 4
  • 510: indeed, 510 = 102 × 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 102). 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.100). 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 102

  • Preceding numbers: …100, 101
  • Following numbers: 103, 104…

Nearest numbers from 102

  • Preceding prime number: 101
  • Following prime number: 103
Find out whether some integer is a prime number