Base | Representation |
---|---|
bin | 11101011011001001111… |
… | …01010010000101010011 |
3 | 10120122121002202022110000 |
4 | 32231210331102011103 |
5 | 113031022320213021 |
6 | 2052241352341043 |
7 | 133020540365232 |
oct | 16554475220523 |
9 | 3518532668400 |
10 | 1011011101011 |
11 | 35a84945607a |
12 | 143b356a4783 |
13 | 744515abc22 |
14 | 36d0c9a6b19 |
15 | 1b473299b26 |
hex | eb64f52153 |
1011011101011 has 40 divisors (see below), whose sum is σ = 1562512010400. Its totient is φ = 650700086400.
The previous prime is 1011011100997. The next prime is 1011011101043. The reversal of 1011011101011 is 1101011101101.
It is not a de Polignac number, because 1011011101011 - 211 = 1011011098963 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 = 1011011100984 and 1011011101002.
It is not an unprimeable number, because it can be changed into a prime (1011011108011) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 35899786 + ... + 35927936.
It is an arithmetic number, because the mean of its divisors is an integer number (39062800260).
Almost surely, 21011011101011 is an apocalyptic number.
1011011101011 is a deficient number, since it is larger than the sum of its proper divisors (551500909389).
1011011101011 is a wasteful number, since it uses less digits than its factorization.
1011011101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43481 (or 43472 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 1011011101011 its reverse (1101011101101), we get a palindrome (2112022202112).
It can be divided in two parts, 101101 and 1101011, that multiplied together give a palindrome (111313313111).
The spelling of 1011011101011 in words is "one trillion, eleven billion, eleven million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •