Base | Representation |
---|---|
bin | 11001000010001010100111… |
… | …011001010101001010010011 |
3 | 112102211110100022101020220221 |
4 | 121002022213121111022103 |
5 | 103412334300011213021 |
6 | 1030055124121013511 |
7 | 32122314432405544 |
oct | 3102124731251223 |
9 | 472743308336827 |
10 | 110100000101011 |
11 | 32099169835178 |
12 | 1042214b324297 |
13 | 4958501b17b6b |
14 | 1d28c22dca4cb |
15 | cade4896c241 |
hex | 6422a7655293 |
110100000101011 has 2 divisors, whose sum is σ = 110100000101012. Its totient is φ = 110100000101010.
The previous prime is 110100000100969. The next prime is 110100000101041. The reversal of 110100000101011 is 110101000001011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110100000101011 - 227 = 110099865883283 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110100000100985 and 110100000101003.
It is not a weakly prime, because it can be changed into another prime (110100000101041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050000050505 + 55050000050506.
It is an arithmetic number, because the mean of its divisors is an integer number (55050000050506).
Almost surely, 2110100000101011 is an apocalyptic number.
110100000101011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100000101011 is an equidigital number, since it uses as much as digits as its factorization.
110100000101011 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 7.
Adding to 110100000101011 its reverse (110101000001011), we get a palindrome (220201000102022).
The spelling of 110100000101011 in words is "one hundred ten trillion, one hundred billion, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •