5000601110001 has 32 divisors (see below), whose sum is σ = 7625952188160. Its totient is φ = 2855241252864.

The previous prime is 5000601109981. The next prime is 5000601110027. The reversal of 5000601110001 is 1000111060005.

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

It is not a de Polignac number, because 5000601110001 - 2⁷ = 5000601109873 is a prime.

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

It is a Curzon number.

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

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 26105.

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

Adding to 5000601110001 its reverse (1000111060005), we get a palindrome (6000712170006).

The spelling of 5000601110001 in words is "five trillion, six hundred one million, one hundred ten thousand, one".