50915433 has 4 divisors (see below), whose sum is σ = 67887248. Its totient is φ = 33943620.

The previous prime is 50915341. The next prime is 50915467. The reversal of 50915433 is 33451905.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 50915433 - 2⁹ = 50914921 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 50915433.

It is not an unprimeable number, because it can be changed into a prime (50915533) 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, 8485903 + ... + 8485908.

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

Almost surely, 2^50915433 is an apocalyptic number.

It is an amenable number.

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

50915433 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 16971814.

The product of its (nonzero) digits is 8100, while the sum is 30.

The square root of 50915433 is about 7135.5050977489. The cubic root of 50915433 is about 370.6378891614.

The spelling of 50915433 in words is "fifty million, nine hundred fifteen thousand, four hundred thirty-three".