Base | Representation |
---|---|
bin | 1001001011111011101100… |
… | …00001100011010000001101 |
3 | 2122112012212011001011121212 |
4 | 10211331312001203100031 |
5 | 10121434040043423432 |
6 | 110544150334504205 |
7 | 4153326563654114 |
oct | 445756601432015 |
9 | 78465764034555 |
10 | 20201211311117 |
11 | 6489316160201 |
12 | 2323168965065 |
13 | b36c73557945 |
14 | 4dba5b174c7b |
15 | 25072e82c2b2 |
hex | 125f7606340d |
20201211311117 has 2 divisors, whose sum is σ = 20201211311118. Its totient is φ = 20201211311116.
The previous prime is 20201211311063. The next prime is 20201211311129. The reversal of 20201211311117 is 71111311210202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19614499738276 + 586711572841 = 4428826^2 + 765971^2 .
It is a cyclic number.
It is not a de Polignac number, because 20201211311117 - 234 = 20184031441933 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20201211311092 and 20201211311101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20201211311137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100605655558 + 10100605655559.
It is an arithmetic number, because the mean of its divisors is an integer number (10100605655559).
Almost surely, 220201211311117 is an apocalyptic number.
It is an amenable number.
20201211311117 is a deficient number, since it is larger than the sum of its proper divisors (1).
20201211311117 is an equidigital number, since it uses as much as digits as its factorization.
20201211311117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 23.
Adding to 20201211311117 its reverse (71111311210202), we get a palindrome (91312522521319).
The spelling of 20201211311117 in words is "twenty trillion, two hundred one billion, two hundred eleven million, three hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •