Base | Representation |
---|---|
bin | 11001000000101101100100… |
… | …111100111000110111010011 |
3 | 112102110220111011210020121222 |
4 | 121000231210330320313103 |
5 | 103404220201340213021 |
6 | 1025541203202435255 |
7 | 32112150023045642 |
oct | 3100554474706723 |
9 | 472426434706558 |
10 | 110000101101011 |
11 | 3205a865413950 |
12 | 1040690b362b2b |
13 | 494bc7120c144 |
14 | 1d2406753b359 |
15 | cab54d5336ab |
hex | 640b64f38dd3 |
110000101101011 has 32 divisors (see below), whose sum is σ = 120728636904960. Its totient is φ = 99395021088000.
The previous prime is 110000101100893. The next prime is 110000101101017. The reversal of 110000101101011 is 110101101000011.
It is a de Polignac number, because none of the positive numbers 2k-110000101101011 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110000101101011.
It is not an unprimeable number, because it can be changed into a prime (110000101101017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2393416850 + ... + 2393462808.
It is an arithmetic number, because the mean of its divisors is an integer number (3772769903280).
Almost surely, 2110000101101011 is an apocalyptic number.
110000101101011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110000101101011 is a deficient number, since it is larger than the sum of its proper divisors (10728535803949).
110000101101011 is a wasteful number, since it uses less digits than its factorization.
110000101101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48155.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 110000101101011 its reverse (110101101000011), we get a palindrome (220101202101022).
The spelling of 110000101101011 in words is "one hundred ten trillion, one hundred one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •