Base | Representation |
---|---|
bin | 11101010010110001011… |
… | …110101111011010000011 |
3 | 21010102221222122021001211 |
4 | 131102301132233122003 |
5 | 230440132203222014 |
6 | 4140434130310551 |
7 | 265302366254236 |
oct | 35226136573203 |
9 | 7112858567054 |
10 | 2013022320259 |
11 | 706799690835 |
12 | 286179128457 |
13 | 117a9a44c612 |
14 | 6d60618941d |
15 | 3756b38ccc4 |
hex | 1d4b17af683 |
2013022320259 has 2 divisors, whose sum is σ = 2013022320260. Its totient is φ = 2013022320258.
The previous prime is 2013022320227. The next prime is 2013022320263. The reversal of 2013022320259 is 9520232203102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2013022320259 - 25 = 2013022320227 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2013022320259.
It is not a weakly prime, because it can be changed into another prime (2013022320269) 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, 1006511160129 + 1006511160130.
It is an arithmetic number, because the mean of its divisors is an integer number (1006511160130).
Almost surely, 22013022320259 is an apocalyptic number.
2013022320259 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013022320259 is an equidigital number, since it uses as much as digits as its factorization.
2013022320259 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 31.
The spelling of 2013022320259 in words is "two trillion, thirteen billion, twenty-two million, three hundred twenty thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •