Base | Representation |
---|---|
bin | 1001001001010010000000… |
… | …00001011111010010110101 |
3 | 2122012111201012202110220011 |
4 | 10210221000001133102311 |
5 | 10113441001404341041 |
6 | 110434242451140221 |
7 | 4143623204130352 |
oct | 444510001372265 |
9 | 78174635673804 |
10 | 20110111012021 |
11 | 6453717440118 |
12 | 23095835a4671 |
13 | b2b4b57ab814 |
14 | 4d749809b629 |
15 | 24d19baaae81 |
hex | 124a4005f4b5 |
20110111012021 has 2 divisors, whose sum is σ = 20110111012022. Its totient is φ = 20110111012020.
The previous prime is 20110111011989. The next prime is 20110111012067. The reversal of 20110111012021 is 12021011101102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12038915241796 + 8071195770225 = 3469714^2 + 2840985^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110111012021 - 25 = 20110111011989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20110111011992 and 20110111012010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110111019021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055055506010 + 10055055506011.
It is an arithmetic number, because the mean of its divisors is an integer number (10055055506011).
Almost surely, 220110111012021 is an apocalyptic number.
It is an amenable number.
20110111012021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110111012021 is an equidigital number, since it uses as much as digits as its factorization.
20110111012021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20110111012021 its reverse (12021011101102), we get a palindrome (32131122113123).
The spelling of 20110111012021 in words is "twenty trillion, one hundred ten billion, one hundred eleven million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.260 sec. • engine limits •