Base | Representation |
---|---|
bin | 11101010010110001011… |
… | …001110010101110111001 |
3 | 21010102221220012100210011 |
4 | 131102301121302232321 |
5 | 230440131340220121 |
6 | 4140434042421521 |
7 | 265302352242511 |
oct | 35226131625671 |
9 | 7112856170704 |
10 | 2013021023161 |
11 | 706798985255 |
12 | 2861788018a1 |
13 | 117a9a0b70c5 |
14 | 6d605d2c841 |
15 | 3756b1d37e1 |
hex | 1d4b1672bb9 |
2013021023161 has 2 divisors, whose sum is σ = 2013021023162. Its totient is φ = 2013021023160.
The previous prime is 2013021023159. The next prime is 2013021023173. The reversal of 2013021023161 is 1613201203102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1887656166400 + 125364856761 = 1373920^2 + 354069^2 .
It is a cyclic number.
It is not a de Polignac number, because 2013021023161 - 21 = 2013021023159 is a prime.
Together with 2013021023159, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2013021023191) 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, 1006510511580 + 1006510511581.
It is an arithmetic number, because the mean of its divisors is an integer number (1006510511581).
Almost surely, 22013021023161 is an apocalyptic number.
It is an amenable number.
2013021023161 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013021023161 is an equidigital number, since it uses as much as digits as its factorization.
2013021023161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2013021023161 its reverse (1613201203102), we get a palindrome (3626222226263).
The spelling of 2013021023161 in words is "two trillion, thirteen billion, twenty-one million, twenty-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •