Search a number
-
+
50505513137 is a prime number
BaseRepresentation
bin101111000010010111…
…001111100010110001
311211100211000220021122
4233002113033202301
51311413402410022
635111340232025
73435400530662
oct570227174261
9154324026248
1050505513137
111a468055602
12995623b615
1349bb705321
14263191d369
1514a8e4b742
hexbc25cf8b1

50505513137 has 2 divisors, whose sum is σ = 50505513138. Its totient is φ = 50505513136.

The previous prime is 50505513073. The next prime is 50505513139. The reversal of 50505513137 is 73131550505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 49572577201 + 932935936 = 222649^2 + 30544^2 .

It is a cyclic number.

It is not a de Polignac number, because 50505513137 - 26 = 50505513073 is a prime.

Together with 50505513139, it forms a pair of twin primes.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 50505513097 and 50505513106.

It is not a weakly prime, because it can be changed into another prime (50505513139) 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, 25252756568 + 25252756569.

It is an arithmetic number, because the mean of its divisors is an integer number (25252756569).

Almost surely, 250505513137 is an apocalyptic number.

It is an amenable number.

50505513137 is a deficient number, since it is larger than the sum of its proper divisors (1).

50505513137 is an equidigital number, since it uses as much as digits as its factorization.

50505513137 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 39375, while the sum is 35.

The spelling of 50505513137 in words is "fifty billion, five hundred five million, five hundred thirteen thousand, one hundred thirty-seven".