Base | Representation |
---|---|
bin | 11101011001011000000… |
… | …100000110101101110011 |
3 | 21011010021002022101210111 |
4 | 131121120010012231303 |
5 | 231044142144201321 |
6 | 4144005433042151 |
7 | 265643155351522 |
oct | 35313004065563 |
9 | 7133232271714 |
10 | 2020112100211 |
11 | 7097a7686407 |
12 | 287617556357 |
13 | 11865a22b29a |
14 | 6dab99d64b9 |
15 | 378339dd5e1 |
hex | 1d658106b73 |
2020112100211 has 8 divisors (see below), whose sum is σ = 2039802317280. Its totient is φ = 2000423373312.
The previous prime is 2020112100199. The next prime is 2020112100221. The reversal of 2020112100211 is 1120012110202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2020112100211 - 223 = 2020103711603 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2020112100191 and 2020112100200.
It is not an unprimeable number, because it can be changed into a prime (2020112100221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2456061 + ... + 3173713.
It is an arithmetic number, because the mean of its divisors is an integer number (254975289660).
Almost surely, 22020112100211 is an apocalyptic number.
2020112100211 is a deficient number, since it is larger than the sum of its proper divisors (19690217069).
2020112100211 is a wasteful number, since it uses less digits than its factorization.
2020112100211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 745085.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2020112100211 its reverse (1120012110202), we get a palindrome (3140124210413).
Subtracting from 2020112100211 its reverse (1120012110202), we obtain a palindrome (900099990009).
The spelling of 2020112100211 in words is "two trillion, twenty billion, one hundred twelve million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •