Base | Representation |
---|---|
bin | 101111000011100010… |
… | …110100011011010101 |
3 | 11211102012022110001211 |
4 | 233003202310123111 |
5 | 1311433440400023 |
6 | 35113325021421 |
7 | 3436031114362 |
oct | 570342643325 |
9 | 154365273054 |
10 | 50525325013 |
11 | 1a478257559 |
12 | 99609b4871 |
13 | 49c2850c27 |
14 | 26343d9469 |
15 | 14aaa61a0d |
hex | bc38b46d5 |
50525325013 has 2 divisors, whose sum is σ = 50525325014. Its totient is φ = 50525325012.
The previous prime is 50525325001. The next prime is 50525325017. The reversal of 50525325013 is 31052352505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39863316964 + 10662008049 = 199658^2 + 103257^2 .
It is a cyclic number.
It is not a de Polignac number, because 50525325013 - 25 = 50525324981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50525325017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25262662506 + 25262662507.
It is an arithmetic number, because the mean of its divisors is an integer number (25262662507).
Almost surely, 250525325013 is an apocalyptic number.
It is an amenable number.
50525325013 is a deficient number, since it is larger than the sum of its proper divisors (1).
50525325013 is an equidigital number, since it uses as much as digits as its factorization.
50525325013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22500, while the sum is 31.
Adding to 50525325013 its reverse (31052352505), we get a palindrome (81577677518).
The spelling of 50525325013 in words is "fifty billion, five hundred twenty-five million, three hundred twenty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •