Base | Representation |
---|---|
bin | 101101110000000000010110… |
… | …110001101100101110011011 |
3 | 222101102120210020121121221102 |
4 | 231300000112301230232123 |
5 | 202333120122030310021 |
6 | 1551535021212502015 |
7 | 60245005254464231 |
oct | 5560002661545633 |
9 | 871376706547842 |
10 | 201211010010011 |
11 | 59126123654971 |
12 | 1a69806017a90b |
13 | 88371698974c1 |
14 | 37989444a6951 |
15 | 183de6064500b |
hex | b70016c6cb9b |
201211010010011 has 2 divisors, whose sum is σ = 201211010010012. Its totient is φ = 201211010010010.
The previous prime is 201211010010007. The next prime is 201211010010013. The reversal of 201211010010011 is 110010010112102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201211010010011 - 22 = 201211010010007 is a prime.
Together with 201211010010013, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 201211010009974 and 201211010010001.
It is not a weakly prime, because it can be changed into another prime (201211010010013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100605505005005 + 100605505005006.
It is an arithmetic number, because the mean of its divisors is an integer number (100605505005006).
Almost surely, 2201211010010011 is an apocalyptic number.
201211010010011 is a deficient number, since it is larger than the sum of its proper divisors (1).
201211010010011 is an equidigital number, since it uses as much as digits as its factorization.
201211010010011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 201211010010011 its reverse (110010010112102), we get a palindrome (311221020122113).
The spelling of 201211010010011 in words is "two hundred one trillion, two hundred eleven billion, ten million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •