51014211032 has 16 divisors (see below), whose sum is σ = 96104974200. Its totient is φ = 25386217920.

The previous prime is 51014211029. The next prime is 51014211047. The reversal of 51014211032 is 23011241015.

It is a junction number, because it is equal to n+sod(n) for n = 51014210995 and 51014211013.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15109157 + ... + 15112532.

Almost surely, 2^51014211032 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 240, while the sum is 20.

Adding to 51014211032 its reverse (23011241015), we get a palindrome (74025452047).

The spelling of 51014211032 in words is "fifty-one billion, fourteen million, two hundred eleven thousand, thirty-two".