Base | Representation |
---|---|
bin | 111011101011001… |
… | …0100101010100001 |
3 | 12011112202102210202 |
4 | 1313112110222201 |
5 | 13100044344023 |
6 | 530405034545 |
7 | 100422420305 |
oct | 16726245241 |
9 | 5145672722 |
10 | 2002340513 |
11 | 9382a6078 |
12 | 47a6b5a55 |
13 | 25bab6794 |
14 | 14dd07d05 |
15 | babc6128 |
hex | 77594aa1 |
2002340513 has 2 divisors, whose sum is σ = 2002340514. Its totient is φ = 2002340512.
The previous prime is 2002340503. The next prime is 2002340531. The reversal of 2002340513 is 3150432002.
It is a happy number.
Together with next prime (2002340531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1702635169 + 299705344 = 41263^2 + 17312^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002340513 - 26 = 2002340449 is a prime.
It is a super-2 number, since 2×20023405132 = 8018735060002206338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2002340503) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1001170256 + 1001170257.
It is an arithmetic number, because the mean of its divisors is an integer number (1001170257).
Almost surely, 22002340513 is an apocalyptic number.
It is an amenable number.
2002340513 is a deficient number, since it is larger than the sum of its proper divisors (1).
2002340513 is an equidigital number, since it uses as much as digits as its factorization.
2002340513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 20.
The square root of 2002340513 is about 44747.5196295839. The cubic root of 2002340513 is about 1260.4123352341.
Adding to 2002340513 its reverse (3150432002), we get a palindrome (5152772515).
The spelling of 2002340513 in words is "two billion, two million, three hundred forty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •