50915131 has 4 divisors (see below), whose sum is σ = 50942392. Its totient is φ = 50887872.

The previous prime is 50915129. The next prime is 50915141. The reversal of 50915131 is 13151905.

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 50915131 - 2¹ = 50915129 is a prime.

It is a super-2 number, since 2×50915131² = 5184701129494322, which contains 22 as substring.

It is a Duffinian number.

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

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

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

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

Almost surely, 2^50915131 is an apocalyptic number.

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

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

50915131 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 27260.

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

The square root of 50915131 is about 7135.4839359360. The cubic root of 50915131 is about 370.6371563589.

The spelling of 50915131 in words is "fifty million, nine hundred fifteen thousand, one hundred thirty-one".