Base | Representation |
---|---|
bin | 1010000001011101000111… |
… | …0011101101111111110011 |
3 | 1110000111211111020221000012 |
4 | 2200113101303231333303 |
5 | 2421023141421011011 |
6 | 35234322534245135 |
7 | 2215114424614424 |
oct | 240272163557763 |
9 | 43014744227005 |
10 | 11020111110131 |
11 | 356966a478692 |
12 | 129b930ab67ab |
13 | 61c265b32416 |
14 | 2a153a50164b |
15 | 1419d2071a8b |
hex | a05d1cedff3 |
11020111110131 has 2 divisors, whose sum is σ = 11020111110132. Its totient is φ = 11020111110130.
The previous prime is 11020111110037. The next prime is 11020111110133. The reversal of 11020111110131 is 13101111102011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11020111110131 - 210 = 11020111109107 is a prime.
It is a super-2 number, since 2×110201111101312 (a number of 27 digits) contains 22 as substring.
Together with 11020111110133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11020111110133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510055555065 + 5510055555066.
It is an arithmetic number, because the mean of its divisors is an integer number (5510055555066).
Almost surely, 211020111110131 is an apocalyptic number.
11020111110131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020111110131 is an equidigital number, since it uses as much as digits as its factorization.
11020111110131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 14.
Adding to 11020111110131 its reverse (13101111102011), we get a palindrome (24121222212142).
The spelling of 11020111110131 in words is "eleven trillion, twenty billion, one hundred eleven million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •