Base | Representation |
---|---|
bin | 1011000000111001101011… |
… | …0111101111001111011111 |
3 | 1120212201022110120001120211 |
4 | 2300032122313233033133 |
5 | 3041403001421010421 |
6 | 41431150325153251 |
7 | 2356632562010110 |
oct | 260163267571737 |
9 | 46781273501524 |
10 | 12110111110111 |
11 | 3949962014653 |
12 | 143702b85b827 |
13 | 69ac94c20201 |
14 | 2dc1bd846207 |
15 | 160029b649e1 |
hex | b039adef3df |
12110111110111 has 16 divisors (see below), whose sum is σ = 14196864807936. Its totient is φ = 10114487714016.
The previous prime is 12110111110093. The next prime is 12110111110127. The reversal of 12110111110111 is 11101111101121.
It is not a de Polignac number, because 12110111110111 - 211 = 12110111108063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12110111110091 and 12110111110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12110111510111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 81002076 + ... + 81151441.
It is an arithmetic number, because the mean of its divisors is an integer number (887304050496).
Almost surely, 212110111110111 is an apocalyptic number.
12110111110111 is a deficient number, since it is larger than the sum of its proper divisors (2086753697825).
12110111110111 is a wasteful number, since it uses less digits than its factorization.
12110111110111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162153798.
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 12110111110111 its reverse (11101111101121), we get a palindrome (23211222211232).
It can be divided in two parts, 1 and 2110111110111, that added together give a palindrome (2110111110112).
The spelling of 12110111110111 in words is "twelve trillion, one hundred ten billion, one hundred eleven million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •