Base | Representation |
---|---|
bin | 1010000000010010001110… |
… | …1100000111000110000011 |
3 | 1102221120221121111021211121 |
4 | 2200010203230013012003 |
5 | 2420211010030323021 |
6 | 35221200154053111 |
7 | 2213503334240050 |
oct | 240044354070603 |
9 | 42846847437747 |
10 | 11000010011011 |
11 | 356109497737a |
12 | 1297a6111a197 |
13 | 61a3b151a928 |
14 | 2a0590a20027 |
15 | 1412074d5741 |
hex | a0123b07183 |
11000010011011 has 8 divisors (see below), whose sum is σ = 12588451439360. Its totient is φ = 9415821439368.
The previous prime is 11000010010963. The next prime is 11000010011027. The reversal of 11000010011011 is 11011001000011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11000010011011 - 217 = 11000009879939 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11000010010985 and 11000010011003.
It is not an unprimeable number, because it can be changed into a prime (11000010011411) 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, 1063208631 + ... + 1063218976.
It is an arithmetic number, because the mean of its divisors is an integer number (1573556429920).
Almost surely, 211000010011011 is an apocalyptic number.
11000010011011 is a deficient number, since it is larger than the sum of its proper divisors (1588441428349).
11000010011011 is an equidigital number, since it uses as much as digits as its factorization.
11000010011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2126428353.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 11000010011011 its reverse (11011001000011), we get a palindrome (22011011011022).
The spelling of 11000010011011 in words is "eleven trillion, ten million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •