Base | Representation |
---|---|
bin | 11101010001110100101… |
… | …011010011000110011011 |
3 | 21010100022220002212220111 |
4 | 131101310223103012123 |
5 | 230431040030431021 |
6 | 4140145005505151 |
7 | 265235201352454 |
oct | 35216453230633 |
9 | 7110286085814 |
10 | 2012002202011 |
11 | 7063158768aa |
12 | 285b335721b7 |
13 | 117966cba259 |
14 | 6d54a8c212b |
15 | 3750ba358e1 |
hex | 1d474ad319b |
2012002202011 has 8 divisors (see below), whose sum is σ = 2019180905280. Its totient is φ = 2004823986312.
The previous prime is 2012002201991. The next prime is 2012002202057. The reversal of 2012002202011 is 1102022002102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2012002202011 is a prime.
It is a super-2 number, since 2×20120022020112 (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 = 2012002201982 and 2012002202000.
It is not an unprimeable number, because it can be changed into a prime (2012002200011) 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, 9495420 + ... + 9704998.
It is an arithmetic number, because the mean of its divisors is an integer number (252397613160).
Almost surely, 22012002202011 is an apocalyptic number.
2012002202011 is a deficient number, since it is larger than the sum of its proper divisors (7178703269).
2012002202011 is a wasteful number, since it uses less digits than its factorization.
2012002202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 243785.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2012002202011 its reverse (1102022002102), we get a palindrome (3114024204113).
The spelling of 2012002202011 in words is "two trillion, twelve billion, two million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •