Base | Representation |
---|---|
bin | 11101010000111110111… |
… | …101100011111101110101 |
3 | 21010021000002101002121202 |
4 | 131100332331203331311 |
5 | 230422213330120041 |
6 | 4135515334222245 |
7 | 265203646421642 |
oct | 35207675437565 |
9 | 7107002332552 |
10 | 2011101020021 |
11 | 7059a31074a5 |
12 | 2859217b4985 |
13 | 11785239b882 |
14 | 6d4a2d38dc9 |
15 | 374a7873a9b |
hex | 1d43ef63f75 |
2011101020021 has 4 divisors (see below), whose sum is σ = 2015230591392. Its totient is φ = 2006971448652.
The previous prime is 2011101020011. The next prime is 2011101020039. The reversal of 2011101020021 is 1200201011102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2011101020021 - 230 = 2010027278197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011101019984 and 2011101020011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011101020011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2064784955 + ... + 2064785928.
It is an arithmetic number, because the mean of its divisors is an integer number (503807647848).
Almost surely, 22011101020021 is an apocalyptic number.
It is an amenable number.
2011101020021 is a deficient number, since it is larger than the sum of its proper divisors (4129571371).
2011101020021 is an equidigital number, since it uses as much as digits as its factorization.
2011101020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4129571370.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2011101020021 its reverse (1200201011102), we get a palindrome (3211302031123).
The spelling of 2011101020021 in words is "two trillion, eleven billion, one hundred one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •