Search a number
-
+
110013011111 is a prime number
BaseRepresentation
bin110011001110101001…
…0010101010010100111
3101111221222220000021002
41212131102111102213
53300301312323421
6122312252343515
710643140110503
oct1463522252247
9344858800232
10110013011111
11427245275a3
12193a3174b9b
13a4b31041a3
145478c0d303
152cdd317b0b
hex199d4954a7

110013011111 has 2 divisors, whose sum is σ = 110013011112. Its totient is φ = 110013011110.

The previous prime is 110013011089. The next prime is 110013011137. The reversal of 110013011111 is 111110310011.

It is a weak prime.

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

It is a cyclic number.

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

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

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

It is a congruent number.

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

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

Almost surely, 2110013011111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 11.

Adding to 110013011111 its reverse (111110310011), we get a palindrome (221123321122).

The spelling of 110013011111 in words is "one hundred ten billion, thirteen million, eleven thousand, one hundred eleven".