Base | Representation |
---|---|
bin | 10111010110100011100000… |
… | …01100001110011110000001 |
3 | 20201211020210210200022100212 |
4 | 23223101300030032132001 |
5 | 23212324420334303121 |
6 | 301115003515123505 |
7 | 13550045046335021 |
oct | 1353216014163601 |
9 | 221736723608325 |
10 | 51352511244161 |
11 | 153a9528927226 |
12 | 5914564143595 |
13 | 22866a092550a |
14 | c97690c1da81 |
15 | 5e0be3b2725b |
hex | 2eb47030e781 |
51352511244161 has 2 divisors, whose sum is σ = 51352511244162. Its totient is φ = 51352511244160.
The previous prime is 51352511244131. The next prime is 51352511244187. The reversal of 51352511244161 is 16144211525315.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 51230793989761 + 121717254400 = 7157569^2 + 348880^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51352511244161 is a prime.
It is a super-2 number, since 2×513525112441612 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51352511244131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25676255622080 + 25676255622081.
It is an arithmetic number, because the mean of its divisors is an integer number (25676255622081).
Almost surely, 251352511244161 is an apocalyptic number.
It is an amenable number.
51352511244161 is a deficient number, since it is larger than the sum of its proper divisors (1).
51352511244161 is an equidigital number, since it uses as much as digits as its factorization.
51352511244161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 144000, while the sum is 41.
Adding to 51352511244161 its reverse (16144211525315), we get a palindrome (67496722769476).
The spelling of 51352511244161 in words is "fifty-one trillion, three hundred fifty-two billion, five hundred eleven million, two hundred forty-four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •