64015141 has 4 divisors (see below), whose sum is σ = 66798432. Its totient is φ = 61231852.

The previous prime is 64015139. The next prime is 64015157. The reversal of 64015141 is 14151046.

64015141 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, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 64015141 - 2¹ = 64015139 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 (64015111) 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, 1391611 + ... + 1391656.

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

Almost surely, 2^64015141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2783290.

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

The square root of 64015141 is about 8000.9462565374. The cubic root of 64015141 is about 400.0315412628.

Adding to 64015141 its reverse (14151046), we get a palindrome (78166187).

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