Base | Representation |
---|---|
bin | 10010101110101010… |
… | …010111100000101001 |
3 | 1220220111220120110211 |
4 | 102232222113200221 |
5 | 312141203223423 |
6 | 13123303341121 |
7 | 1311230655046 |
oct | 225652274051 |
9 | 56814816424 |
10 | 20110211113 |
11 | 858a765293 |
12 | 3a92a517a1 |
13 | 1b86485105 |
14 | d8abb41cd |
15 | 7ca78b10d |
hex | 4aea97829 |
20110211113 has 16 divisors (see below), whose sum is σ = 20400629760. Its totient is φ = 19822320000.
The previous prime is 20110211089. The next prime is 20110211123. The reversal of 20110211113 is 31111201102.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20110211113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20110211093 and 20110211102.
It is not an unprimeable number, because it can be changed into a prime (20110211123) 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 in 15 ways as a sum of consecutive naturals, for example, 24257983 + ... + 24258811.
It is an arithmetic number, because the mean of its divisors is an integer number (1275039360).
Almost surely, 220110211113 is an apocalyptic number.
It is an amenable number.
20110211113 is a deficient number, since it is larger than the sum of its proper divisors (290418647).
20110211113 is a wasteful number, since it uses less digits than its factorization.
20110211113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1968.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 20110211113 its reverse (31111201102), we get a palindrome (51221412215).
The spelling of 20110211113 in words is "twenty billion, one hundred ten million, two hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •