Base | Representation |
---|---|
bin | 11101011010011001000… |
… | …010001010011000111011 |
3 | 21011020002001100122010211 |
4 | 131122121002022120323 |
5 | 231103410220010021 |
6 | 4144305531451551 |
7 | 266012162315620 |
oct | 35323102123073 |
9 | 7136061318124 |
10 | 2021202110011 |
11 | 70a206997957 |
12 | 2878805b6bb7 |
13 | 1187a1cc19b6 |
14 | 6db80694347 |
15 | 3789954e3e1 |
hex | 1d69908a63b |
2021202110011 has 8 divisors (see below), whose sum is σ = 2359093040640. Its totient is φ = 1695598122408.
The previous prime is 2021202110009. The next prime is 2021202110047. The reversal of 2021202110011 is 1100112021202.
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 2021202110011 - 21 = 2021202110009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2021202109973 and 2021202110000.
It is not an unprimeable number, because it can be changed into a prime (2021202110111) 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, 3071735401 + ... + 3071736058.
It is an arithmetic number, because the mean of its divisors is an integer number (294886630080).
Almost surely, 22021202110011 is an apocalyptic number.
2021202110011 is a deficient number, since it is larger than the sum of its proper divisors (337890930629).
2021202110011 is an equidigital number, since it uses as much as digits as its factorization.
2021202110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6143471513.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2021202110011 its reverse (1100112021202), we get a palindrome (3121314131213).
It can be divided in two parts, 2021202 and 110011, that multiplied together give a palindrome (222354453222).
The spelling of 2021202110011 in words is "two trillion, twenty-one billion, two hundred two million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •