Base | Representation |
---|---|
bin | 1010000000111011100011… |
… | …0000111000010100110011 |
3 | 1102222122120120010221220000 |
4 | 2200032320300320110303 |
5 | 2420401213324013021 |
6 | 35230232512321043 |
7 | 2214345230140626 |
oct | 240167060702463 |
9 | 42878516127800 |
10 | 11011101001011 |
11 | 3565866502311 |
12 | 129a037543183 |
13 | 61b45b2529c7 |
14 | 2a0d23a17dbd |
15 | 141656049b26 |
hex | a03b8c38533 |
11011101001011 has 40 divisors (see below), whose sum is σ = 16625603791104. Its totient is φ = 7262193743280.
The previous prime is 11011101000997. The next prime is 11011101001079. The reversal of 11011101001011 is 11010010111011.
It is not a de Polignac number, because 11011101001011 - 27 = 11011101000883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11011101000984 and 11011101001002.
It is not an unprimeable number, because it can be changed into a prime (11011101001811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 925266 + ... + 4783128.
Almost surely, 211011101001011 is an apocalyptic number.
11011101001011 is a deficient number, since it is larger than the sum of its proper divisors (5614502790093).
11011101001011 is a wasteful number, since it uses less digits than its factorization.
11011101001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3858253 (or 3858244 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11011101001011 its reverse (11010010111011), we get a palindrome (22021111112022).
The spelling of 11011101001011 in words is "eleven trillion, eleven billion, one hundred one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •