Search a number
-
+
31323421301 is a prime number
BaseRepresentation
bin11101001011000001…
…010111101001110101
32222211222112200002212
4131023001113221311
51003122243440201
622220105343205
72156136454664
oct351301275165
988758480085
1031323421301
1112314289047
1260a2197b05
132c52610823
141732104ddb
15c34de3abb
hex74b057a75

31323421301 has 2 divisors, whose sum is σ = 31323421302. Its totient is φ = 31323421300.

The previous prime is 31323421291. The next prime is 31323421303. The reversal of 31323421301 is 10312432313.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 31311656401 + 11764900 = 176951^2 + 3430^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-31323421301 is a prime.

Together with 31323421303, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 231323421301 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 23.

Adding to 31323421301 its reverse (10312432313), we get a palindrome (41635853614).

The spelling of 31323421301 in words is "thirty-one billion, three hundred twenty-three million, four hundred twenty-one thousand, three hundred one".