Base | Representation |
---|---|
bin | 1010000001011100101111… |
… | …0110101000100101100111 |
3 | 1110000111120112021112022111 |
4 | 2200113023312220211213 |
5 | 2421022440332223421 |
6 | 35234305005141451 |
7 | 2215112102522560 |
oct | 240271366504547 |
9 | 43014515245274 |
10 | 11020011211111 |
11 | 3569619046011 |
12 | 129b90355a887 |
13 | 61c24b225886 |
14 | 2a152b139167 |
15 | 1419c83dbee1 |
hex | a05cbda8967 |
11020011211111 has 16 divisors (see below), whose sum is σ = 12626715299328. Its totient is φ = 9421440890400.
The previous prime is 11020011211103. The next prime is 11020011211123. The reversal of 11020011211111 is 11111211002011.
11020011211111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11020011211111 - 23 = 11020011211103 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11020011211091 and 11020011211100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020011211171) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3242976 + ... + 5705866.
It is an arithmetic number, because the mean of its divisors is an integer number (789169706208).
Almost surely, 211020011211111 is an apocalyptic number.
11020011211111 is a deficient number, since it is larger than the sum of its proper divisors (1606704088217).
11020011211111 is a wasteful number, since it uses less digits than its factorization.
11020011211111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2464542.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11020011211111 its reverse (11111211002011), we get a palindrome (22131222213122).
The spelling of 11020011211111 in words is "eleven trillion, twenty billion, eleven million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •