Base | Representation |
---|---|
bin | 11101010000111010001… |
… | …000011111111011111101 |
3 | 21010020210102220220110001 |
4 | 131100322020133323331 |
5 | 230422032110013041 |
6 | 4135503321514301 |
7 | 265201643652643 |
oct | 35207210377375 |
9 | 7106712826401 |
10 | 2011020001021 |
11 | 7059613aa749 |
12 | 2858ba642991 |
13 | 11783b672735 |
14 | 6d496289193 |
15 | 374a06bd131 |
hex | 1d43a21fefd |
2011020001021 has 4 divisors (see below), whose sum is σ = 2011142439072. Its totient is φ = 2010897562972.
The previous prime is 2011020000989. The next prime is 2011020001027. The reversal of 2011020001021 is 1201000201102.
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 2011020001021 - 25 = 2011020000989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011020000989 and 2011020001007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011020001027) 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, 61194385 + ... + 61227238.
It is an arithmetic number, because the mean of its divisors is an integer number (502785609768).
Almost surely, 22011020001021 is an apocalyptic number.
It is an amenable number.
2011020001021 is a deficient number, since it is larger than the sum of its proper divisors (122438051).
2011020001021 is a wasteful number, since it uses less digits than its factorization.
2011020001021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122438050.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2011020001021 its reverse (1201000201102), we get a palindrome (3212020202123).
The spelling of 2011020001021 in words is "two trillion, eleven billion, twenty million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •