Base | Representation |
---|---|
bin | 1010000000010101111101… |
… | …0110111101110101010011 |
3 | 1102221200112101012221011000 |
4 | 2200011133112331311103 |
5 | 2420220032320213021 |
6 | 35221443354553043 |
7 | 2213540211330561 |
oct | 240053726756523 |
9 | 42850471187130 |
10 | 11001011101011 |
11 | 3561558a75088 |
12 | 12980a0438783 |
13 | 61a510a49c89 |
14 | 2a0647972a31 |
15 | 14126532eb26 |
hex | a015f5bdd53 |
11001011101011 has 8 divisors (see below), whose sum is σ = 16297794223760. Its totient is φ = 7334007400656.
The previous prime is 11001011100949. The next prime is 11001011101021. The reversal of 11001011101011 is 11010111010011.
It is not a de Polignac number, because 11001011101011 - 210 = 11001011099987 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11001011100984 and 11001011101002.
It is not an unprimeable number, because it can be changed into a prime (11001011101021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 203722427770 + ... + 203722427823.
It is an arithmetic number, because the mean of its divisors is an integer number (2037224277970).
Almost surely, 211001011101011 is an apocalyptic number.
11001011101011 is a deficient number, since it is larger than the sum of its proper divisors (5296783122749).
11001011101011 is an equidigital number, since it uses as much as digits as its factorization.
11001011101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 407444855602 (or 407444855596 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11001011101011 its reverse (11010111010011), we get a palindrome (22011122111022).
The spelling of 11001011101011 in words is "eleven trillion, one billion, eleven million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •