Is 793 a prime number?

It is possible to find out using mathematical methods whether a given integer is a prime number or not.

For 793, the answer is: No, 793 is not a prime number.

The list of all positive divisors (i.e., the list of all integers that divide 793) is as follows: 1, 13, 61, 793.

For 793 to be a prime number, it would have been required that 793 has only two divisors, i.e., itself and 1.

Find out more:

What is a prime number?

As a consequence:

793 is a multiple of 1
793 is a multiple of 13
793 is a multiple of 61

For 793 to be a prime number, it would have been required that 793 has only two divisors, i.e., itself and 1.

However, 793 is a semiprime (also called biprime or 2-almost-prime), because it is the product of a two non-necessarily distinct prime numbers. Indeed, 793 = 13 x 61, where 13 and 61 are both prime numbers.

Is 793 a deficient number?

Yes, 793 is a deficient number, that is to say 793 is a natural number that is strictly larger than the sum of its proper divisors, i.e., the divisors of 793 without 793 itself (that is 1 + 13 + 61 = 75).

Parity of 793

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

Find out more:

What is an even number?

Is 793 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 793 is about 28.160.

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

What is the square number of 793?

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

The square of 793 is 628 849 because 793 × 793 = 793² = 628 849.

As a consequence, 793 is the square root of 628 849.

Number of digits of 793

793 is a number with 3 digits.

What are the multiples of 793?

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

0: indeed, 0 is divisible by any natural number, and it is thus a multiple of 793 too, since 0 × 793 = 0
793: indeed, 793 is a multiple of itself, since 793 is evenly divisible by 793 (we have 793 / 793 = 1, so the remainder of this division is indeed zero)
1 586: indeed, 1 586 = 793 × 2
2 379: indeed, 2 379 = 793 × 3
3 172: indeed, 3 172 = 793 × 4
3 965: indeed, 3 965 = 793 × 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 793). 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 28.160). 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 793

Preceding numbers: …791, 792
Following numbers: 794, 795…

Nearest numbers from 793

Preceding prime number: 787
Following prime number: 797