51101556051 has 48 divisors (see below), whose sum is σ = 85922204928. Its totient is φ = 26776008000.

The previous prime is 51101555983. The next prime is 51101556053. The reversal of 51101556051 is 15065510115.

It is not a de Polignac number, because 51101556051 - 2⁹ = 51101555539 is a prime.

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

It is not an unprimeable number, because it can be changed into a prime (51101556053) by changing a digit.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 200016 + ... + 377106.

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

Almost surely, 2^51101556051 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 3750, while the sum is 30.

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