Base | Representation |
---|---|
bin | 10010101110101010… |
… | …010111100001000101 |
3 | 1220220111220120111212 |
4 | 102232222113201011 |
5 | 312141203224031 |
6 | 13123303341205 |
7 | 1311230655116 |
oct | 225652274105 |
9 | 56814816455 |
10 | 20110211141 |
11 | 858a765309 |
12 | 3a92a51805 |
13 | 1b86485127 |
14 | d8abb420d |
15 | 7ca78b12b |
hex | 4aea97845 |
20110211141 has 2 divisors, whose sum is σ = 20110211142. Its totient is φ = 20110211140.
The previous prime is 20110211123. The next prime is 20110211197. The reversal of 20110211141 is 14111201102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19893974116 + 216237025 = 141046^2 + 14705^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110211141 - 222 = 20106016837 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110211441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055105570 + 10055105571.
It is an arithmetic number, because the mean of its divisors is an integer number (10055105571).
Almost surely, 220110211141 is an apocalyptic number.
It is an amenable number.
20110211141 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110211141 is an equidigital number, since it uses as much as digits as its factorization.
20110211141 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 20110211141 its reverse (14111201102), we get a palindrome (34221412243).
The spelling of 20110211141 in words is "twenty billion, one hundred ten million, two hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •