Search a number
BaseRepresentation
bin1100001110000011
32112122202
430032003
53100201
61023415
7265631
oct141603
975582
1050051
1134671
1224b6b
1319a21
1414351
15ec6b
hexc383

50051 has 2 divisors, whose sum is σ = 50052. Its totient is φ = 50050.

The previous prime is 50047. The next prime is 50053. The reversal of 50051 is 15005.

Adding to 50051 its reverse (15005), we get a palindrome (65056).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 50051 - 22 = 50047 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a zygodrome in base 2.

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

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

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

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

250051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 25, while the sum is 11.

The square root of 50051 is about 223.7208081516. The cubic root of 50051 is about 36.8528364372.

The spelling of 50051 in words is "fifty thousand, fifty-one".