Base | Representation |
---|---|
bin | 1001001001010100001110… |
… | …11111101100001001001111 |
3 | 2122012121210210002000212222 |
4 | 10210222013133230021033 |
5 | 10114000430342030221 |
6 | 110435001444045555 |
7 | 4143665004244556 |
oct | 444520737541117 |
9 | 78177723060788 |
10 | 20111310111311 |
11 | 6454182291171 |
12 | 23098590938bb |
13 | b2b647049023 |
14 | 4d756d434d9d |
15 | 24d21beb99ab |
hex | 124a877ec24f |
20111310111311 has 2 divisors, whose sum is σ = 20111310111312. Its totient is φ = 20111310111310.
The previous prime is 20111310111209. The next prime is 20111310111317. The reversal of 20111310111311 is 11311101311102.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20111310111311 - 218 = 20111309849167 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20111310111311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111310111317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055655055655 + 10055655055656.
It is an arithmetic number, because the mean of its divisors is an integer number (10055655055656).
Almost surely, 220111310111311 is an apocalyptic number.
20111310111311 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111310111311 is an equidigital number, since it uses as much as digits as its factorization.
20111310111311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 17.
Adding to 20111310111311 its reverse (11311101311102), we get a palindrome (31422411422413).
The spelling of 20111310111311 in words is "twenty trillion, one hundred eleven billion, three hundred ten million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •