It is possible to find out using mathematical methods whether a given integer is a prime number or not.
For 983, the answer is: yes, 983 is a prime number because it has only two distinct divisors: 1 and itself (983).
As a consequence, 983 is only a multiple of 1 and 983..
Since 983 is a prime number, 983 is also a deficient number, that is to say 983 is a natural integer that is strictly larger than the sum of its proper divisors, i.e., the divisors of 983 without 983 itself (that is 1, by definition!).
Parity of 983
983 is an odd number, because it is not evenly divisible by 2.
Is 983 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 983 is about 31.353.
Thus, the square root of 983 is not an integer, and therefore 983 is not a square number.
Anyway, 983 is a prime number, and a prime number cannot be a perfect square.
What is the square number of 983?
The square of a number (here 983) is the result of the product of this number (983) by itself (i.e., 983 × 983); the square of 983 is sometimes called "raising 983 to the power 2", or "983 squared".
As a consequence, 983 is the square root of 966 289.
Number of digits of 983
983 is a number with 3 digits.
What are the multiples of 983?
The multiples of 983 are all integers evenly divisible by 983, that is all numbers such that the remainder of the division by 983 is zero. There are infinitely many multiples of 983. The smallest multiples of 983 are:
- 0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 983 too, since 0 × 983 = 0
- 983: indeed, 983 is a multiple of itself, since 983 is evenly divisible by 983 (we have 983 / 983 = 1, so the remainder of this division is indeed zero)
- 1 966: indeed, 1 966 = 983 × 2
- 2 949: indeed, 2 949 = 983 × 3
- 3 932: indeed, 3 932 = 983 × 4
- 4 915: indeed, 4 915 = 983 × 5
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 983). 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 31.353). 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.