Search a number
-
+
50150957 is a prime number
BaseRepresentation
bin1011111101001…
…1111000101101
310111100221011212
42333103320231
5100314312312
64550524205
71146163463
oct277237055
9114327155
1050150957
112634417a
1214966665
13a50c02c
146936833
154609822
hex2fd3e2d

50150957 has 2 divisors, whose sum is σ = 50150958. Its totient is φ = 50150956.

The previous prime is 50150953. The next prime is 50150959. The reversal of 50150957 is 75905105.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 43744996 + 6405961 = 6614^2 + 2531^2 .

It is a cyclic number.

It is not a de Polignac number, because 50150957 - 22 = 50150953 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 250150957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7875, while the sum is 32.

The square root of 50150957 is about 7081.7340390613. The cubic root of 50150957 is about 368.7735309316.

The spelling of 50150957 in words is "fifty million, one hundred fifty thousand, nine hundred fifty-seven".