56000610500050 has 12 divisors (see below), whose sum is σ = 104161135530186. Its totient is φ = 22400244200000.

The previous prime is 56000610500047. The next prime is 56000610500057. The reversal of 56000610500050 is 5000501600065.

It can be written as a sum of positive squares in 3 ways, for example, as 54647592544801 + 1353017955249 = 7392401^2 + 1163193^2 .

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

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

It is not an unprimeable number, because it can be changed into a prime (56000610500057) 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 5 ways as a sum of consecutive naturals, for example, 560006104951 + ... + 560006105050.

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

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

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

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

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

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

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

The spelling of 56000610500050 in words is "fifty-six trillion, six hundred ten million, five hundred thousand, fifty".