51105000560051 has 16 divisors (see below), whose sum is σ = 51571279872000. Its totient is φ = 50639758612128.

The previous prime is 51105000560041. The next prime is 51105000560057. The reversal of 51105000560051 is 15006500050115.

It is a happy number.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-51105000560051 is a prime.

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

It is a Duffinian number.

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

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 334821050 + ... + 334973648.

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

Almost surely, 2^{51105000560051} is an apocalyptic number.

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

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

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

The sum of its prime factors is 155978.

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

The spelling of 51105000560051 in words is "fifty-one trillion, one hundred five billion, five hundred sixty thousand, fifty-one".