51050050100 has 72 divisors (see below), whose sum is σ = 126969581760. Its totient is φ = 17452350720.

The previous prime is 51050050099. The next prime is 51050050127. The reversal of 51050050100 is 105005015.

It is a super-2 number, since 2×51050050100² (a number of 22 digits) contains 22 as substring.

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 23 ways as a sum of consecutive naturals, for example, 137816 + ... + 347984.

Almost surely, 2^51050050100 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 125, while the sum is 17.

Adding to 51050050100 its reverse (105005015), we get a palindrome (51155055115).

The spelling of 51050050100 in words is "fifty-one billion, fifty million, fifty thousand, one hundred".