Base | Representation |
---|---|
bin | 111010010101100011111000… |
… | …0000000100001110011000001 |
3 | 2111021212101101201111020201102 |
4 | 1310223013300000201303001 |
5 | 1014224212332013102111 |
6 | 5015203420312544145 |
7 | 213040620440246405 |
oct | 16453076000416301 |
9 | 2437771351436642 |
10 | 513136654425281 |
11 | 13955703aa83917 |
12 | 496753a33b2055 |
13 | 1904276aa62983 |
14 | 909dd3762d105 |
15 | 3e4ccde20013b |
hex | 1d2b1f0021cc1 |
513136654425281 has 2 divisors, whose sum is σ = 513136654425282. Its totient is φ = 513136654425280.
The previous prime is 513136654425257. The next prime is 513136654425323. The reversal of 513136654425281 is 182524456631315.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 332669000294656 + 180467654130625 = 18239216^2 + 13433825^2 .
It is a cyclic number.
It is not a de Polignac number, because 513136654425281 - 238 = 512861776518337 is a prime.
It is a super-2 number, since 2×5131366544252812 (a number of 30 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (513136653425281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 256568327212640 + 256568327212641.
It is an arithmetic number, because the mean of its divisors is an integer number (256568327212641).
Almost surely, 2513136654425281 is an apocalyptic number.
It is an amenable number.
513136654425281 is a deficient number, since it is larger than the sum of its proper divisors (1).
513136654425281 is an equidigital number, since it uses as much as digits as its factorization.
513136654425281 is an evil number, because the sum of its binary digits is even.
The product of its digits is 20736000, while the sum is 56.
The spelling of 513136654425281 in words is "five hundred thirteen trillion, one hundred thirty-six billion, six hundred fifty-four million, four hundred twenty-five thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •