Base | Representation |
---|---|
bin | 101111011010110000… |
… | …001110001001111101 |
3 | 11212102100000110122221 |
4 | 233122300032021331 |
5 | 1313233131323422 |
6 | 35220115005341 |
7 | 3451466634052 |
oct | 573260161175 |
9 | 155370013587 |
10 | 50914714237 |
11 | 1a658035432 |
12 | 9a4b299851 |
13 | 4a5541895a |
14 | 266dddb029 |
15 | 14ced2b3c7 |
hex | bdac0e27d |
50914714237 has 2 divisors, whose sum is σ = 50914714238. Its totient is φ = 50914714236.
The previous prime is 50914714183. The next prime is 50914714261. The reversal of 50914714237 is 73241741905.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29051838916 + 21862875321 = 170446^2 + 147861^2 .
It is a cyclic number.
It is not a de Polignac number, because 50914714237 - 235 = 16554975869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50914714193 and 50914714202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50914714297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25457357118 + 25457357119.
It is an arithmetic number, because the mean of its divisors is an integer number (25457357119).
Almost surely, 250914714237 is an apocalyptic number.
It is an amenable number.
50914714237 is a deficient number, since it is larger than the sum of its proper divisors (1).
50914714237 is an equidigital number, since it uses as much as digits as its factorization.
50914714237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 211680, while the sum is 43.
The spelling of 50914714237 in words is "fifty billion, nine hundred fourteen million, seven hundred fourteen thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •