Search a number
-
+
31311132021331 is a prime number
BaseRepresentation
bin1110001111010001100001…
…11001101101001001010011
311002212022111121220111011121
413013220300321231021103
513101000144244140311
6150332045132423111
76411104016603361
oct707506071551123
9132768447814147
1031311132021331
119a81a81823678
123618382917a97
13146181c906856
147a3677170631
1539471b16ab71
hex1c7a30e6d253

31311132021331 has 2 divisors, whose sum is σ = 31311132021332. Its totient is φ = 31311132021330.

The previous prime is 31311132021149. The next prime is 31311132021373. The reversal of 31311132021331 is 13312023111313.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 31311132021331 - 219 = 31311131497043 is a prime.

It is a super-2 number, since 2×313111320213312 (a number of 28 digits) contains 22 as substring.

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

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

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

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

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

Almost surely, 231311132021331 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 25.

Adding to 31311132021331 its reverse (13312023111313), we get a palindrome (44623155132644).

The spelling of 31311132021331 in words is "thirty-one trillion, three hundred eleven billion, one hundred thirty-two million, twenty-one thousand, three hundred thirty-one".