Base | Representation |
---|---|
bin | 11101100011101101000… |
… | …010000101010100111101 |
3 | 21012011212220121121212122 |
4 | 131203231002011110331 |
5 | 231234400013410023 |
6 | 4153042045212325 |
7 | 266515030156331 |
oct | 35435502052475 |
9 | 7164786547778 |
10 | 2031201310013 |
11 | 713478205907 |
12 | 2897b12610a5 |
13 | 11970678bca5 |
14 | 7044c6897c1 |
15 | 37c823002c8 |
hex | 1d8ed08553d |
2031201310013 has 2 divisors, whose sum is σ = 2031201310014. Its totient is φ = 2031201310012.
The previous prime is 2031201309979. The next prime is 2031201310049. The reversal of 2031201310013 is 3100131021302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1416949787449 + 614251522564 = 1190357^2 + 783742^2 .
It is a cyclic number.
It is not a de Polignac number, because 2031201310013 - 210 = 2031201308989 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2031201309973 and 2031201310000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2031201310063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1015600655006 + 1015600655007.
It is an arithmetic number, because the mean of its divisors is an integer number (1015600655007).
Almost surely, 22031201310013 is an apocalyptic number.
It is an amenable number.
2031201310013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2031201310013 is an equidigital number, since it uses as much as digits as its factorization.
2031201310013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 2031201310013 its reverse (3100131021302), we get a palindrome (5131332331315).
The spelling of 2031201310013 in words is "two trillion, thirty-one billion, two hundred one million, three hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •