Base | Representation |
---|---|
bin | 11101011001010111011… |
… | …010001110000011010011 |
3 | 21011010020022122120001211 |
4 | 131121113122032003103 |
5 | 231044131341321321 |
6 | 4144004401440551 |
7 | 265642663131046 |
oct | 35312732160323 |
9 | 7133208576054 |
10 | 2020101120211 |
11 | 7097a1466a29 |
12 | 287613940157 |
13 | 118657b85645 |
14 | 6dab8378c5d |
15 | 37832a700e1 |
hex | 1d65768e0d3 |
2020101120211 has 8 divisors (see below), whose sum is σ = 2034322383600. Its totient is φ = 2005888704288.
The previous prime is 2020101120209. The next prime is 2020101120259. The reversal of 2020101120211 is 1120211010202.
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 2020101120211 - 21 = 2020101120209 is a prime.
It is a super-3 number, since 3×20201011202113 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2020101120191 and 2020101120200.
It is not an unprimeable number, because it can be changed into a prime (2020101120311) 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, 1753276 + ... + 2667241.
It is an arithmetic number, because the mean of its divisors is an integer number (254290297950).
Almost surely, 22020101120211 is an apocalyptic number.
2020101120211 is a deficient number, since it is larger than the sum of its proper divisors (14221263389).
2020101120211 is a wasteful number, since it uses less digits than its factorization.
2020101120211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4423733.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2020101120211 its reverse (1120211010202), we get a palindrome (3140312130413).
The spelling of 2020101120211 in words is "two trillion, twenty billion, one hundred one million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •