51016141 has 6 divisors (see below), whose sum is σ = 56075726. Its totient is φ = 46378200.

The previous prime is 51016087. The next prime is 51016151. The reversal of 51016141 is 14161015.

51016141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in only one way, i.e., 39312900 + 11703241 = 6270^2 + 3421^2 .

It is not a de Polignac number, because 51016141 - 2¹³ = 51007949 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 210690 + ... + 210931.

Almost surely, 2^51016141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 421643 (or 421632 counting only the distinct ones).

The product of its (nonzero) digits is 120, while the sum is 19.

The square root of 51016141 is about 7142.5584351827. The cubic root of 51016141 is about 370.8820955222.

Adding to 51016141 its reverse (14161015), we get a palindrome (65177156).

The spelling of 51016141 in words is "fifty-one million, sixteen thousand, one hundred forty-one".