50110056037 has 2 divisors, whose sum is σ = 50110056038. Its totient is φ = 50110056036.

The previous prime is 50110055971. The next prime is 50110056041. The reversal of 50110056037 is 73065001105.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 49546753281 + 563302756 = 222591^2 + 23734^2 .

It is a cyclic number.

It is not a de Polignac number, because 50110056037 - 2²⁷ = 49975838309 is a prime.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (50110756037) by changing a digit.

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 as a sum of consecutive naturals, namely, 25055028018 + 25055028019.

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

Almost surely, 2^50110056037 is an apocalyptic number.

It is an amenable number.

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

50110056037 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 3150, while the sum is 28.

The spelling of 50110056037 in words is "fifty billion, one hundred ten million, fifty-six thousand, thirty-seven".