Search a number
-
+
110010131200027 is a prime number
BaseRepresentation
bin11001000000110110111010…
…110010101011100000011011
3112102111212101012012001211201
4121000312322302223200123
5103404401222041400102
61025545542342335031
732112653414351062
oct3100667262534033
9472455335161751
10110010131200027
1132064042116783
121040884a42a477
13494cbac207686
141d247396971d9
15cab938d89987
hex640dbacab81b

110010131200027 has 2 divisors, whose sum is σ = 110010131200028. Its totient is φ = 110010131200026.

The previous prime is 110010131200019. The next prime is 110010131200159. The reversal of 110010131200027 is 720002131010011.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 110010131200027 - 23 = 110010131200019 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (110010131210027) 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, 55005065600013 + 55005065600014.

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

Almost surely, 2110010131200027 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 84, while the sum is 19.

Adding to 110010131200027 its reverse (720002131010011), we get a palindrome (830012262210038).

The spelling of 110010131200027 in words is "one hundred ten trillion, ten billion, one hundred thirty-one million, two hundred thousand, twenty-seven".