Search a number
-
+
50500051 = 77214293
BaseRepresentation
bin1100000010100…
…1000111010011
310112000200001021
43000221013103
5100412000201
65002220311
71152146320
oct300510723
9115020037
1050500051
1126562488
1214ab4697
13a601bb4
1469c7b47
154677ea1
hex30291d3

50500051 has 4 divisors (see below), whose sum is σ = 57714352. Its totient is φ = 43285752.

The previous prime is 50500003. The next prime is 50500057. The reversal of 50500051 is 15000505.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 50500051 - 27 = 50499923 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (50500057) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3607140 + ... + 3607153.

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

Almost surely, 250500051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 7214300.

The product of its (nonzero) digits is 125, while the sum is 16.

The square root of 50500051 is about 7106.3387901225. The cubic root of 50500051 is about 369.6272140146.

Adding to 50500051 its reverse (15000505), we get a palindrome (65500556).

The spelling of 50500051 in words is "fifty million, five hundred thousand, fifty-one".

Divisors: 1 7 7214293 50500051