Base | Representation |
---|---|
bin | 10110111110000110001010… |
… | …10001001010110011111001 |
3 | 20121211220121211201110122212 |
4 | 23133003011101022303321 |
5 | 23110042313000410431 |
6 | 255232541101424505 |
7 | 13432244355255353 |
oct | 1337030521126371 |
9 | 217756554643585 |
10 | 50512125013241 |
11 | 151050877a3491 |
12 | 57b970856b135 |
13 | 22253718962a8 |
14 | c68b2acac0d3 |
15 | 5c8e09ea972b |
hex | 2df0c544acf9 |
50512125013241 has 2 divisors, whose sum is σ = 50512125013242. Its totient is φ = 50512125013240.
The previous prime is 50512125013219. The next prime is 50512125013247. The reversal of 50512125013241 is 14231052121505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 48733956102841 + 1778168910400 = 6980971^2 + 1333480^2 .
It is a cyclic number.
It is not a de Polignac number, because 50512125013241 - 234 = 50494945144057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50512125013198 and 50512125013207.
It is not a weakly prime, because it can be changed into another prime (50512125013247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25256062506620 + 25256062506621.
It is an arithmetic number, because the mean of its divisors is an integer number (25256062506621).
Almost surely, 250512125013241 is an apocalyptic number.
It is an amenable number.
50512125013241 is a deficient number, since it is larger than the sum of its proper divisors (1).
50512125013241 is an equidigital number, since it uses as much as digits as its factorization.
50512125013241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12000, while the sum is 32.
Adding to 50512125013241 its reverse (14231052121505), we get a palindrome (64743177134746).
The spelling of 50512125013241 in words is "fifty trillion, five hundred twelve billion, one hundred twenty-five million, thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •