Base | Representation |
---|---|
bin | 1001001001010010001011… |
… | …11011100001011010000111 |
3 | 2122012111222010020020021211 |
4 | 10210221011323201122013 |
5 | 10113441202242023421 |
6 | 110434300351152251 |
7 | 4143625516351111 |
oct | 444510573413207 |
9 | 78174863206254 |
10 | 20110210111111 |
11 | 645376837679a |
12 | 23095b0815687 |
13 | b2b500198233 |
14 | 4d74a72d63b1 |
15 | 24d1a56339e1 |
hex | 124a45ee1687 |
20110210111111 has 2 divisors, whose sum is σ = 20110210111112. Its totient is φ = 20110210111110.
The previous prime is 20110210111091. The next prime is 20110210111157. The reversal of 20110210111111 is 11111101201102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20110210111111 - 223 = 20110201722503 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20110210111091 and 20110210111100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110210211111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055105055555 + 10055105055556.
It is an arithmetic number, because the mean of its divisors is an integer number (10055105055556).
Almost surely, 220110210111111 is an apocalyptic number.
20110210111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110210111111 is an equidigital number, since it uses as much as digits as its factorization.
20110210111111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 20110210111111 its reverse (11111101201102), we get a palindrome (31221311312213).
The spelling of 20110210111111 in words is "twenty trillion, one hundred ten billion, two hundred ten million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •