Search a number
-
+
110110201111 = 1011090200011
BaseRepresentation
bin110011010001100010…
…1000101010100010111
3101112012202202202212201
41212203011011110113
53301001202413421
6122330043425331
710645430160331
oct1464305052427
9345182682781
10110110201111
1142774379909
121940b825247
13a4ca2a2971
145487aac451
152ce6b14b91
hex19a3145517

110110201111 has 4 divisors (see below), whose sum is σ = 111200401224. Its totient is φ = 109020001000.

The previous prime is 110110201073. The next prime is 110110201121. The reversal of 110110201111 is 111102011011.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 111102011011 = 1011100019911.

It is a cyclic number.

It is not a de Polignac number, because 110110201111 - 211 = 110110199063 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110110201121) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 545099905 + ... + 545100106.

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

Almost surely, 2110110201111 is an apocalyptic number.

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

110110201111 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1090200112.

The product of its (nonzero) digits is 2, while the sum is 10.

Adding to 110110201111 its reverse (111102011011), we get a palindrome (221212212122).

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

Divisors: 1 101 1090200011 110110201111