Search a number
110110110011116 = 2227527527502779
BaseRepresentation
bin11001000010010100000001…
…111111100100111011101100
3112102212102102212221220100221
4121002110001333210323230
5103413021001130323431
61030103515231301124
732123123113256245
oct3102240177447354
9472772385856327
10110110110011116
11320a248759a286
12104240b107a7a4
1349594535087a7
141d2950199dccc
15cae33b2db111
hex642501fe4eec

110110110011116 has 6 divisors (see below), whose sum is σ = 192692692519460. Its totient is φ = 55055055005556.

The previous prime is 110110110011113. The next prime is 110110110011117. The reversal of 110110110011116 is 611110011011011.

It is a self number, because there is not a number n which added to its sum of digits gives 110110110011116.

It is not an unprimeable number, because it can be changed into a prime (110110110011113) 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, 13763763751386 + ... + 13763763751393.

Almost surely, 2110110110011116 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 6, while the sum is 16.

Adding to 110110110011116 its reverse (611110011011011), we get a palindrome (721220121022127).

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