Base | Representation |
---|---|
bin | 11101000111100110000… |
… | …101100110110011111011 |
3 | 21002021222112012100010002 |
4 | 131013212011212303323 |
5 | 230241042111201021 |
6 | 4131131135343215 |
7 | 264366066356123 |
oct | 35074605466373 |
9 | 7067875170102 |
10 | 2001020022011 |
11 | 70169a6aa48a |
12 | 283989681b0b |
13 | 1169069919aa |
14 | 6cbc812dc83 |
15 | 370b781650b |
hex | 1d1e6166cfb |
2001020022011 has 4 divisors (see below), whose sum is σ = 2002792405800. Its totient is φ = 1999247638224.
The previous prime is 2001020021999. The next prime is 2001020022041. The reversal of 2001020022011 is 1102200201002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2001020022011 is a prime.
It is a super-2 number, since 2×20010200220112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001020021983 and 2001020022001.
It is not an unprimeable number, because it can be changed into a prime (2001020022041) 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, 886190201 + ... + 886192458.
It is an arithmetic number, because the mean of its divisors is an integer number (500698101450).
Almost surely, 22001020022011 is an apocalyptic number.
2001020022011 is a deficient number, since it is larger than the sum of its proper divisors (1772383789).
2001020022011 is a wasteful number, since it uses less digits than its factorization.
2001020022011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1772383788.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2001020022011 its reverse (1102200201002), we get a palindrome (3103220223013).
The spelling of 2001020022011 in words is "two trillion, one billion, twenty million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •