Search a number
-
+
10110000101111 is a prime number
BaseRepresentation
bin1001001100011110101011…
…1101101111011011110111
31022210111200021211100220022
42103013222331233123313
52311120240011213421
633300245300555355
72062265140645451
oct223075275573367
938714607740808
1010110000101111
113248699543099
1211734766b2b5b
135844a468c451
1426d48033b2d1
15127eb705a7ab
hex931eaf6f6f7

10110000101111 has 2 divisors, whose sum is σ = 10110000101112. Its totient is φ = 10110000101110.

The previous prime is 10110000101023. The next prime is 10110000101119. The reversal of 10110000101111 is 11110100001101.

It is an a-pointer prime, because the next prime (10110000101119) can be obtained adding 10110000101111 to its sum of digits (8).

It is a strong prime.

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

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 210110000101111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1, while the sum is 8.

Adding to 10110000101111 its reverse (11110100001101), we get a palindrome (21220100102212).

The spelling of 10110000101111 in words is "ten trillion, one hundred ten billion, one hundred one thousand, one hundred eleven".