Base | Representation |
---|---|
bin | 10111011110101001000011… |
… | …00101011001001111001001 |
3 | 20202210210222221010121212222 |
4 | 23233110201211121033021 |
5 | 23231402442010103131 |
6 | 301450355024143425 |
7 | 13606112404101311 |
oct | 1357244145311711 |
9 | 222723887117788 |
10 | 51630365316041 |
11 | 154a6351246996 |
12 | 595a388a67b75 |
13 | 22a69515ca735 |
14 | ca6ccca76441 |
15 | 5e8056e7e87b |
hex | 2ef5219593c9 |
51630365316041 has 2 divisors, whose sum is σ = 51630365316042. Its totient is φ = 51630365316040.
The previous prime is 51630365316011. The next prime is 51630365316043. The reversal of 51630365316041 is 14061356303615.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46643982529600 + 4986382786441 = 6829640^2 + 2233021^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51630365316041 is a prime.
Together with 51630365316043, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 51630365315983 and 51630365316001.
It is not a weakly prime, because it can be changed into another prime (51630365316043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25815182658020 + 25815182658021.
It is an arithmetic number, because the mean of its divisors is an integer number (25815182658021).
Almost surely, 251630365316041 is an apocalyptic number.
It is an amenable number.
51630365316041 is a deficient number, since it is larger than the sum of its proper divisors (1).
51630365316041 is an equidigital number, since it uses as much as digits as its factorization.
51630365316041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 583200, while the sum is 44.
The spelling of 51630365316041 in words is "fifty-one trillion, six hundred thirty billion, three hundred sixty-five million, three hundred sixteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •