Search a number
110110110111 = 3231139339089
BaseRepresentation
bin110011010001100010…
…0101111000110011111
3101112012202121011001100
41212203010233012133
53301001142010421
6122330041444143
710645426331121
oct1464304570637
9345182534040
10110110110111
1142774317501
121940b7a0653
13a4ca270411
145487a87211
152ce6ae7c26
hex19a312f19f

110110110111 has 12 divisors (see below), whose sum is σ = 159559349040. Its totient is φ = 73170703680.

The previous prime is 110110110109. The next prime is 110110110167. The reversal of 110110110111 is 111011011011.

Adding to 110110110111 its reverse (111011011011), we get a palindrome (221121121122).

It is not a de Polignac number, because 110110110111 - 21 = 110110110109 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19666746 + ... + 19672343.

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

Almost surely, 2110110110111 is an apocalyptic number.

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

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

110110110111 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 39339406 (or 39339403 counting only the distinct ones).

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

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