50056111005009 has 8 divisors (see below), whose sum is σ = 66890126066400. Its totient is φ = 33296418306816.

The previous prime is 50056111004987. The next prime is 50056111005013. The reversal of 50056111005009 is 90050011165005.

50056111005009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 50056111005009 - 2⁷ = 50056111004881 is a prime.

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

It is a Curzon number.

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

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 37161181599.

The product of its (nonzero) digits is 6750, while the sum is 33.

The spelling of 50056111005009 in words is "fifty trillion, fifty-six billion, one hundred eleven million, five thousand, nine".