Base | Representation |
---|---|
bin | 11101010010110000111… |
… | …000001101100010011001 |
3 | 21010102221021122010012021 |
4 | 131102300320031202121 |
5 | 230440122112020212 |
6 | 4140433130014441 |
7 | 265302214356466 |
oct | 35226070154231 |
9 | 7112837563167 |
10 | 2013012220057 |
11 | 706793a12363 |
12 | 286175877421 |
13 | 117a98324277 |
14 | 6d604aba66d |
15 | 3756a545307 |
hex | 1d4b0e0d899 |
2013012220057 has 2 divisors, whose sum is σ = 2013012220058. Its totient is φ = 2013012220056.
The previous prime is 2013012220031. The next prime is 2013012220073. The reversal of 2013012220057 is 7500222103102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1998084023296 + 14928196761 = 1413536^2 + 122181^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2013012220057 is a prime.
It is a super-3 number, since 3×20130122200573 (a number of 38 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (2013012220657) 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 as a sum of consecutive naturals, namely, 1006506110028 + 1006506110029.
It is an arithmetic number, because the mean of its divisors is an integer number (1006506110029).
Almost surely, 22013012220057 is an apocalyptic number.
It is an amenable number.
2013012220057 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013012220057 is an equidigital number, since it uses as much as digits as its factorization.
2013012220057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 25.
Adding to 2013012220057 its reverse (7500222103102), we get a palindrome (9513234323159).
The spelling of 2013012220057 in words is "two trillion, thirteen billion, twelve million, two hundred twenty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •