Base | Representation |
---|---|
bin | 1010000000010010001100… |
… | …1001110001110101000011 |
3 | 1102221120220222120001011021 |
4 | 2200010203021301311003 |
5 | 2420211000224323021 |
6 | 35221155233130311 |
7 | 2213503164604015 |
oct | 240044311616503 |
9 | 42846828501137 |
10 | 11000001011011 |
11 | 356108a88a561 |
12 | 1297a5a0b9997 |
13 | 61a3ac6b929c |
14 | 2a058d75a1b5 |
15 | 141206808c41 |
hex | a0123271d43 |
11000001011011 has 4 divisors (see below), whose sum is σ = 11207548199952. Its totient is φ = 10792453822072.
The previous prime is 11000001010997. The next prime is 11000001011057. The reversal of 11000001011011 is 11011010000011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11000001011011 - 27 = 11000001010883 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11000001010985 and 11000001011003.
It is not an unprimeable number, because it can be changed into a prime (11000001011411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 103773594391 + ... + 103773594496.
It is an arithmetic number, because the mean of its divisors is an integer number (2801887049988).
Almost surely, 211000001011011 is an apocalyptic number.
11000001011011 is a deficient number, since it is larger than the sum of its proper divisors (207547188941).
11000001011011 is an equidigital number, since it uses as much as digits as its factorization.
11000001011011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207547188940.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 11000001011011 its reverse (11011010000011), we get a palindrome (22011011011022).
The spelling of 11000001011011 in words is "eleven trillion, one million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •