Base | Representation |
---|---|
bin | 1010000110110000011111… |
… | …0010100110101101010011 |
3 | 1110100012222101221221221111 |
4 | 2201230013302212231103 |
5 | 2424021230020213021 |
6 | 35344230411234151 |
7 | 2224521112015450 |
oct | 241540762465523 |
9 | 43305871857844 |
10 | 11111211101011 |
11 | 35a4268aa814a |
12 | 12b5516148957 |
13 | 627a23801178 |
14 | 2a5add538827 |
15 | 144064c818e1 |
hex | a1b07ca6b53 |
11111211101011 has 16 divisors (see below), whose sum is σ = 12714684392448. Its totient is φ = 9511780824000.
The previous prime is 11111211100993. The next prime is 11111211101041. The reversal of 11111211101011 is 11010111211111.
11111211101011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-11111211101011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11111211100982 and 11111211101000.
It is not an unprimeable number, because it can be changed into a prime (11111211101041) 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, 37111711 + ... + 37409911.
It is an arithmetic number, because the mean of its divisors is an integer number (794667774528).
Almost surely, 211111211101011 is an apocalyptic number.
11111211101011 is a deficient number, since it is larger than the sum of its proper divisors (1603473291437).
11111211101011 is an equidigital number, since it uses as much as digits as its factorization.
11111211101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 304962.
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 11111211101011 its reverse (11010111211111), we get a palindrome (22121322312122).
The spelling of 11111211101011 in words is "eleven trillion, one hundred eleven billion, two hundred eleven million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •