Search a number
-
+
50063141 is a prime number
BaseRepresentation
bin1011111011111…
…0011100100101
310111012110201102
42332332130211
5100304010031
64545005445
71145346452
oct276763445
9114173642
1050063141
11262941a7
1214923885
13a4ab07b
146912829
1545dd7cb
hex2fbe725

50063141 has 2 divisors, whose sum is σ = 50063142. Its totient is φ = 50063140.

The previous prime is 50063107. The next prime is 50063149. The reversal of 50063141 is 14136005.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 40322500 + 9740641 = 6350^2 + 3121^2 .

It is a cyclic number.

It is not a de Polignac number, because 50063141 - 214 = 50046757 is a prime.

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (50063149) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25031570 + 25031571.

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

Almost surely, 250063141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 360, while the sum is 20.

The square root of 50063141 is about 7075.5311461402. The cubic root of 50063141 is about 368.5581602542.

Adding to 50063141 its reverse (14136005), we get a palindrome (64199146).

The spelling of 50063141 in words is "fifty million, sixty-three thousand, one hundred forty-one".