Base | Representation |
---|---|
bin | 1001001001000001011100… |
… | …00101011001011010001011 |
3 | 2122011122202120221221221012 |
4 | 10210200232011121122023 |
5 | 10113314244322041021 |
6 | 110430212324234135 |
7 | 4143156654542153 |
oct | 444405605313213 |
9 | 78148676857835 |
10 | 20101220112011 |
11 | 644a974796375 |
12 | 2307901b3b94b |
13 | b2a6c980a03c |
14 | 4d6c93365763 |
15 | 24cd2b28035b |
hex | 12482e15968b |
20101220112011 has 2 divisors, whose sum is σ = 20101220112012. Its totient is φ = 20101220112010.
The previous prime is 20101220111989. The next prime is 20101220112013. The reversal of 20101220112011 is 11021102210102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20101220112011 - 222 = 20101215917707 is a prime.
Together with 20101220112013, 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 (20101220112013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050610056005 + 10050610056006.
It is an arithmetic number, because the mean of its divisors is an integer number (10050610056006).
Almost surely, 220101220112011 is an apocalyptic number.
20101220112011 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101220112011 is an equidigital number, since it uses as much as digits as its factorization.
20101220112011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20101220112011 its reverse (11021102210102), we get a palindrome (31122322322113).
The spelling of 20101220112011 in words is "twenty trillion, one hundred one billion, two hundred twenty million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •