Base | Representation |
---|---|
bin | 11101000111110010000… |
… | …100010100001001011011 |
3 | 21002022111112101120211002 |
4 | 131013302010110021123 |
5 | 230242000034310021 |
6 | 4131203115255215 |
7 | 264404056630016 |
oct | 35076204241133 |
9 | 7068445346732 |
10 | 2001221010011 |
11 | 7017930a7773 |
12 | 283a24a4a50b |
13 | 1169395038c2 |
14 | 6cc06acc37d |
15 | 370ca2b850b |
hex | 1d1f211425b |
2001221010011 has 4 divisors (see below), whose sum is σ = 2002157474952. Its totient is φ = 2000284545072.
The previous prime is 2001221010007. The next prime is 2001221010037. The reversal of 2001221010011 is 1100101221002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2001221010011 - 22 = 2001221010007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2001221009974 and 2001221010001.
It is not an unprimeable number, because it can be changed into a prime (2001221040011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 468229265 + ... + 468233538.
It is an arithmetic number, because the mean of its divisors is an integer number (500539368738).
Almost surely, 22001221010011 is an apocalyptic number.
2001221010011 is a deficient number, since it is larger than the sum of its proper divisors (936464941).
2001221010011 is an equidigital number, since it uses as much as digits as its factorization.
2001221010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 936464940.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2001221010011 its reverse (1100101221002), we get a palindrome (3101322231013).
The spelling of 2001221010011 in words is "two trillion, one billion, two hundred twenty-one million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •