Base | Representation |
---|---|
bin | 1010000000111011100011… |
… | …0001010010111011111011 |
3 | 1102222122120120100111102001 |
4 | 2200032320301102323323 |
5 | 2420401213341010021 |
6 | 35230232514521431 |
7 | 2214345231103462 |
oct | 240167061227373 |
9 | 42878516314361 |
10 | 11011101110011 |
11 | 35658665771a2 |
12 | 129a037596277 |
13 | 61b45b2904c2 |
14 | 2a0d23a459d9 |
15 | 14165606c091 |
hex | a03b8c52efb |
11011101110011 has 32 divisors (see below), whose sum is σ = 11984999270400. Its totient is φ = 10084272007680.
The previous prime is 11011101109849. The next prime is 11011101110041. The reversal of 11011101110011 is 11001110111011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11011101110011 - 29 = 11011101109499 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 11011101110011.
It is not an unprimeable number, because it can be changed into a prime (11011101110041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14644746 + ... + 15378256.
It is an arithmetic number, because the mean of its divisors is an integer number (374531227200).
Almost surely, 211011101110011 is an apocalyptic number.
11011101110011 is a deficient number, since it is larger than the sum of its proper divisors (973898160389).
11011101110011 is a wasteful number, since it uses less digits than its factorization.
11011101110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 733819.
The product of its (nonzero) digits is 1, while the sum is 10.
Adding to 11011101110011 its reverse (11001110111011), we get a palindrome (22012211221022).
The spelling of 11011101110011 in words is "eleven trillion, eleven billion, one hundred one million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •