51064141 has 4 divisors (see below), whose sum is σ = 54067932. Its totient is φ = 48060352.

The previous prime is 51064129. The next prime is 51064159. The reversal of 51064141 is 14146015.

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

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

It can be written as a sum of positive squares in 2 ways, for example, as 47748100 + 3316041 = 6910^2 + 1821^2 .

It is a cyclic number.

It is not a de Polignac number, because 51064141 - 2⁵ = 51064109 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 (51064121) 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 3 ways as a sum of consecutive naturals, for example, 1501870 + ... + 1501903.

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

Almost surely, 2^51064141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3003790.

The product of its (nonzero) digits is 480, while the sum is 22.

The square root of 51064141 is about 7145.9177857011. The cubic root of 51064141 is about 370.9983774144.

The spelling of 51064141 in words is "fifty-one million, sixty-four thousand, one hundred forty-one".