53010051 has 4 divisors (see below), whose sum is σ = 70680072. Its totient is φ = 35340032.

The previous prime is 53009987. The next prime is 53010053. The reversal of 53010051 is 15001035.

53010051 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 is a cyclic number.

It is not a de Polignac number, because 53010051 - 2⁶ = 53009987 is a prime.

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

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

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

Almost surely, 2^53010051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 17670020.

The product of its (nonzero) digits is 75, while the sum is 15.

The square root of 53010051 is about 7280.8001620701. The cubic root of 53010051 is about 375.6523188446.

Adding to 53010051 its reverse (15001035), we get a palindrome (68011086).

The spelling of 53010051 in words is "fifty-three million, ten thousand, fifty-one".