Base | Representation |
---|---|
bin | 10010101000001001… |
… | …110011110111011011 |
3 | 1220121220102202010002 |
4 | 102220021303313123 |
5 | 311430224410321 |
6 | 13104403043215 |
7 | 1305433543604 |
oct | 225011636733 |
9 | 56556382102 |
10 | 20001013211 |
11 | 8534061293 |
12 | 3a6237050b |
13 | 1b69970b7a |
14 | d7a4aadab |
15 | 7c0dbb20b |
hex | 4a8273ddb |
20001013211 has 4 divisors (see below), whose sum is σ = 20158501632. Its totient is φ = 19843524792.
The previous prime is 20001013183. The next prime is 20001013283. The reversal of 20001013211 is 11231010002.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11231010002 = 2 ⋅5615505001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20001013211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20001013192 and 20001013201.
It is not an unprimeable number, because it can be changed into a prime (20001063211) 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 in 3 ways as a sum of consecutive naturals, for example, 78744020 + ... + 78744273.
It is an arithmetic number, because the mean of its divisors is an integer number (5039625408).
Almost surely, 220001013211 is an apocalyptic number.
20001013211 is a deficient number, since it is larger than the sum of its proper divisors (157488421).
20001013211 is a wasteful number, since it uses less digits than its factorization.
20001013211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 157488420.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 20001013211 its reverse (11231010002), we get a palindrome (31232023213).
The spelling of 20001013211 in words is "twenty billion, one million, thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •