Base | Representation |
---|---|
bin | 11001000010010100111101… |
… | …100110101001101100111011 |
3 | 112102212112000120211012010202 |
4 | 121002110331212221230323 |
5 | 103413030023142010021 |
6 | 1030104202355032415 |
7 | 32123156646051413 |
oct | 3102247546515473 |
9 | 472775016735122 |
10 | 110111110110011 |
11 | 320a295008039a |
12 | 1042432bb9b70b |
13 | 495958277b99a |
14 | 1d29598735643 |
15 | cae398edba0b |
hex | 64253d9a9b3b |
110111110110011 has 2 divisors, whose sum is σ = 110111110110012. Its totient is φ = 110111110110010.
The previous prime is 110111110109971. The next prime is 110111110110031. The reversal of 110111110110011 is 110011011111011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110111110110011 - 226 = 110111043001147 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110111110109974 and 110111110110001.
It is not a weakly prime, because it can be changed into another prime (110111110110031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055555055005 + 55055555055006.
It is an arithmetic number, because the mean of its divisors is an integer number (55055555055006).
Almost surely, 2110111110110011 is an apocalyptic number.
110111110110011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111110110011 is an equidigital number, since it uses as much as digits as its factorization.
110111110110011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1, while the sum is 11.
Adding to 110111110110011 its reverse (110011011111011), we get a palindrome (220122121221022).
The spelling of 110111110110011 in words is "one hundred ten trillion, one hundred eleven billion, one hundred ten million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •