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