Base | Representation |
---|---|
bin | 10110000001011001000… |
… | …001110100110110000011 |
3 | 12100200011000120220211112 |
4 | 112001121001310312003 |
5 | 144243240431422021 |
6 | 3115113253233535 |
7 | 214222350640664 |
oct | 26013101646603 |
9 | 5320130526745 |
10 | 1513322139011 |
11 | 533883993631 |
12 | 2053606328ab |
13 | ac923467cb7 |
14 | 53360acd36b |
15 | 29571c2ed5b |
hex | 16059074d83 |
1513322139011 has 2 divisors, whose sum is σ = 1513322139012. Its totient is φ = 1513322139010.
The previous prime is 1513322138947. The next prime is 1513322139013. The reversal of 1513322139011 is 1109312233151.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1513322139011 - 26 = 1513322138947 is a prime.
It is a Sophie Germain prime.
Together with 1513322139013, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1513322139013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 756661069505 + 756661069506.
It is an arithmetic number, because the mean of its divisors is an integer number (756661069506).
Almost surely, 21513322139011 is an apocalyptic number.
1513322139011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1513322139011 is an equidigital number, since it uses as much as digits as its factorization.
1513322139011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 32.
The spelling of 1513322139011 in words is "one trillion, five hundred thirteen billion, three hundred twenty-two million, one hundred thirty-nine thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •