4901111 has 2 divisors, whose sum is σ = 4901112. Its totient is φ = 4901110.

The previous prime is 4901101. The next prime is 4901129. The reversal of 4901111 is 1111094.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 4901111 - 2¹⁰ = 4900087 is a prime.

It is a Sophie Germain prime.

4901111 is a modest number, since divided by 1111 gives 490 as remainder.

It is a self number, because there is not a number n which added to its sum of digits gives 4901111.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2450555 + 2450556.

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

Almost surely, 2^4901111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 17.

The square root of 4901111 is about 2213.8452972148. The cubic root of 4901111 is about 169.8627612110.

Subtracting from 4901111 its sum of digits (17), we obtain a palindrome (4901094).

The spelling of 4901111 in words is "four million, nine hundred one thousand, one hundred eleven".