Search a number
-
+
31056829 is a prime number
BaseRepresentation
bin111011001111…
…0001110111101
32011102211221221
41312132032331
530422304304
63025353341
7524656456
oct166361675
964384857
1031056829
1116592501
12a498851
13658502b
1441a612d
152ad7054
hex1d9e3bd

31056829 has 2 divisors, whose sum is σ = 31056830. Its totient is φ = 31056828.

The previous prime is 31056763. The next prime is 31056863. The reversal of 31056829 is 92865013.

It is an a-pointer prime, because the next prime (31056863) can be obtained adding 31056829 to its sum of digits (34).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 28334329 + 2722500 = 5323^2 + 1650^2 .

It is an emirp because it is prime and its reverse (92865013) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 31056829 - 217 = 30925757 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 31056794 and 31056803.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (31056889) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a good prime.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15528414 + 15528415.

It is an arithmetic number, because the mean of its divisors is an integer number (15528415).

Almost surely, 231056829 is an apocalyptic number.

It is an amenable number.

31056829 is a deficient number, since it is larger than the sum of its proper divisors (1).

31056829 is an equidigital number, since it uses as much as digits as its factorization.

31056829 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 12960, while the sum is 34.

The square root of 31056829 is about 5572.8654209482. The cubic root of 31056829 is about 314.3299066842.

The spelling of 31056829 in words is "thirty-one million, fifty-six thousand, eight hundred twenty-nine".