Base | Representation |
---|---|
bin | 10110111110011110001111… |
… | …10011101110001101111011 |
3 | 20121220010222210010020100122 |
4 | 23133033013303232031323 |
5 | 23110300301421334413 |
6 | 255242515543123455 |
7 | 13433212621314302 |
oct | 1337170763561573 |
9 | 217803883106318 |
10 | 50525052527483 |
11 | 1510a610a6a256 |
12 | 5800115a4358b |
13 | 2226651c38bc1 |
14 | c695d5b69439 |
15 | 5c9414d8e108 |
hex | 2df3c7cee37b |
50525052527483 has 2 divisors, whose sum is σ = 50525052527484. Its totient is φ = 50525052527482.
The previous prime is 50525052527473. The next prime is 50525052527591. The reversal of 50525052527483 is 38472525052505.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50525052527483 - 28 = 50525052527227 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (50525052527413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25262526263741 + 25262526263742.
It is an arithmetic number, because the mean of its divisors is an integer number (25262526263742).
Almost surely, 250525052527483 is an apocalyptic number.
50525052527483 is a deficient number, since it is larger than the sum of its proper divisors (1).
50525052527483 is an equidigital number, since it uses as much as digits as its factorization.
50525052527483 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16800000, while the sum is 53.
Adding to 50525052527483 its reverse (38472525052505), we get a palindrome (88997577579988).
The spelling of 50525052527483 in words is "fifty trillion, five hundred twenty-five billion, fifty-two million, five hundred twenty-seven thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •