4890101001111 has 8 divisors (see below), whose sum is σ = 7244594075760. Its totient is φ = 3260067334056.

The previous prime is 4890101001101. The next prime is 4890101001179. The reversal of 4890101001111 is 1111001010984.

It is a happy number.

It is not a de Polignac number, because 4890101001111 - 2⁹ = 4890101000599 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 181114851893 = 4890101001111 / (4 + 8 + 9 + 0 + 1 + 0 + 1 + 0 + 0 + 1 + 1 + 1 + 1).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (4890101001101) 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, 90557425920 + ... + 90557425973.

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

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

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

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

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

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

The product of its (nonzero) digits is 288, while the sum is 27.

The spelling of 4890101001111 in words is "four trillion, eight hundred ninety billion, one hundred one million, one thousand, one hundred eleven".