51013050 has 96 divisors (see below), whose sum is σ = 141419520. Its totient is φ = 12062400.

The previous prime is 51013033. The next prime is 51013051. The reversal of 51013050 is 5031015.

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

It is a Harshad number since it is a multiple of its sum of digits (15).

It is not an unprimeable number, because it can be changed into a prime (51013051) 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 47 ways as a sum of consecutive naturals, for example, 70591 + ... + 71309.

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

Almost surely, 2^51013050 is an apocalyptic number.

51013050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 51013050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70709760).

51013050 is an abundant number, since it is smaller than the sum of its proper divisors (90406470).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

The square root of 51013050 is about 7142.3420528563. The cubic root of 51013050 is about 370.8746049536.

Adding to 51013050 its reverse (5031015), we get a palindrome (56044065).

The spelling of 51013050 in words is "fifty-one million, thirteen thousand, fifty".