Search a number
-
+
2001101111111 is a prime number
BaseRepresentation
bin11101000111101010111…
…010111011111101000111
321002022012011210002110002
4131013222322323331013
5230241223341023421
64131143153351515
7264401102536364
oct35075272737507
97068164702402
102001101111111
11701731454973
122839b086859b
1311691a7139cb
146cbd4bdb46b
15370be9d2b0b
hex1d1eaebbf47

2001101111111 has 2 divisors, whose sum is σ = 2001101111112. Its totient is φ = 2001101111110.

The previous prime is 2001101111077. The next prime is 2001101111123. The reversal of 2001101111111 is 1111111011002.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 2001101111111 - 230 = 2000027369287 is a prime.

It is a super-3 number, since 3×20011011111113 (a number of 38 digits) contains 333 as substring.

It is a Sophie Germain prime.

2001101111111 is a modest number, since divided by 1111111 gives 200110 as remainder.

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

It is a congruent number.

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

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

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

Almost surely, 22001101111111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2, while the sum is 11.

Adding to 2001101111111 its reverse (1111111011002), we get a palindrome (3112212122113).

The spelling of 2001101111111 in words is "two trillion, one billion, one hundred one million, one hundred eleven thousand, one hundred eleven".