Base | Representation |
---|---|
bin | 10111010110100010101001… |
… | …00100001100111001011011 |
3 | 20201211012121111120020101221 |
4 | 23223101110210030321123 |
5 | 23212322443212022011 |
6 | 301114445521152511 |
7 | 13550030421005026 |
oct | 1353212444147133 |
9 | 221735544506357 |
10 | 51352047767131 |
11 | 153a9310246061 |
12 | 5914454a8b737 |
13 | 22866288ba457 |
14 | c976494541bd |
15 | 5e0bb80c5971 |
hex | 2eb45490ce5b |
51352047767131 has 2 divisors, whose sum is σ = 51352047767132. Its totient is φ = 51352047767130.
The previous prime is 51352047767123. The next prime is 51352047767159. The reversal of 51352047767131 is 13176774025315.
51352047767131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51352047767131 - 23 = 51352047767123 is a prime.
It is a super-2 number, since 2×513520477671312 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51352047765131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25676023883565 + 25676023883566.
It is an arithmetic number, because the mean of its divisors is an integer number (25676023883566).
Almost surely, 251352047767131 is an apocalyptic number.
51352047767131 is a deficient number, since it is larger than the sum of its proper divisors (1).
51352047767131 is an equidigital number, since it uses as much as digits as its factorization.
51352047767131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3704400, while the sum is 52.
The spelling of 51352047767131 in words is "fifty-one trillion, three hundred fifty-two billion, forty-seven million, seven hundred sixty-seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •