Base | Representation |
---|---|
bin | 11101011010011000111… |
… | …010100010001010000011 |
3 | 21011020001220121000221011 |
4 | 131122120322202022003 |
5 | 231103404212011321 |
6 | 4144305420541351 |
7 | 266012136316402 |
oct | 35323072421203 |
9 | 7136056530834 |
10 | 2021200110211 |
11 | 70a205851427 |
12 | 28787b9b1857 |
13 | 1187a1771699 |
14 | 6db802d3639 |
15 | 378992a6ae1 |
hex | 1d698ea2283 |
2021200110211 has 8 divisors (see below), whose sum is σ = 2127878737920. Its totient is φ = 1914551449992.
The previous prime is 2021200110199. The next prime is 2021200110217. The reversal of 2021200110211 is 1120110021202.
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 2021200110211 - 233 = 2012610175619 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2021200110191 and 2021200110200.
It is not an unprimeable number, because it can be changed into a prime (2021200110217) 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 7 ways as a sum of consecutive naturals, for example, 7353355 + ... + 7623268.
It is an arithmetic number, because the mean of its divisors is an integer number (265984842240).
Almost surely, 22021200110211 is an apocalyptic number.
2021200110211 is a deficient number, since it is larger than the sum of its proper divisors (106678627709).
2021200110211 is a wasteful number, since it uses less digits than its factorization.
2021200110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14983745.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2021200110211 its reverse (1120110021202), we get a palindrome (3141310131413).
The spelling of 2021200110211 in words is "two trillion, twenty-one billion, two hundred million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •