Search a number
-
+
201324224113031 is a prime number
BaseRepresentation
bin101101110001101001110010…
…110111001110100110000111
3222101211102000022220221210002
4231301221302313032212013
5202341444002333104111
61552103023255551515
760256123644463355
oct5561516267164607
9871742008827702
10201324224113031
115916a140000168
121a6b5b9738b59b
138844a3cc301c6
1437a02044a67d5
151841d899c463b
hexb71a72dce987

201324224113031 has 2 divisors, whose sum is σ = 201324224113032. Its totient is φ = 201324224113030.

The previous prime is 201324224112997. The next prime is 201324224113039. The reversal of 201324224113031 is 130311422423102.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 201324224113031 - 214 = 201324224096647 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2201324224113031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 6912, while the sum is 29.

Adding to 201324224113031 its reverse (130311422423102), we get a palindrome (331635646536133).

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