Base | Representation |
---|---|
bin | 1001000001011100000… |
… | …11100001011010000001 |
3 | 1002122012011002222221201 |
4 | 10200232003201122001 |
5 | 20034400120224023 |
6 | 354230005021201 |
7 | 31253226150265 |
oct | 4405603413201 |
9 | 1078164088851 |
10 | 310010320513 |
11 | 10a524820263 |
12 | 500b99b4801 |
13 | 233069c079a |
14 | 1100c7d00a5 |
15 | 80e6409bad |
hex | 482e0e1681 |
310010320513 has 2 divisors, whose sum is σ = 310010320514. Its totient is φ = 310010320512.
The previous prime is 310010320493. The next prime is 310010320531. The reversal of 310010320513 is 315023010013.
Together with next prime (310010320531) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 289253579329 + 20756741184 = 537823^2 + 144072^2 .
It is a cyclic number.
It is not a de Polignac number, because 310010320513 - 225 = 309976766081 is a prime.
It is a super-2 number, since 2×3100103205132 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (310010320913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 155005160256 + 155005160257.
It is an arithmetic number, because the mean of its divisors is an integer number (155005160257).
Almost surely, 2310010320513 is an apocalyptic number.
It is an amenable number.
310010320513 is a deficient number, since it is larger than the sum of its proper divisors (1).
310010320513 is an equidigital number, since it uses as much as digits as its factorization.
310010320513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 270, while the sum is 19.
Adding to 310010320513 its reverse (315023010013), we get a palindrome (625033330526).
The spelling of 310010320513 in words is "three hundred ten billion, ten million, three hundred twenty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •