Search a number
-
+
2011011011 is a prime number
BaseRepresentation
bin111011111011101…
…1001011111000011
312012011001221111022
41313313121133003
513104304323021
6531314540055
7100556211602
oct16767313703
95164057438
102011011011
11942188379
1248159762b
13260831159
14151123a39
15bb83a1ab
hex77dd97c3

2011011011 has 2 divisors, whose sum is σ = 2011011012. Its totient is φ = 2011011010.

The previous prime is 2011011007. The next prime is 2011011077. The reversal of 2011011011 is 1101101102.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 2011011011 - 22 = 2011011007 is a prime.

It is a Sophie Germain prime.

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

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

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

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

Almost surely, 22011011011 is an apocalyptic number.

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

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

2011011011 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 8.

The square root of 2011011011 is about 44844.2974189584. The cubic root of 2011011011 is about 1262.2289870322.

Adding to 2011011011 its reverse (1101101102), we get a palindrome (3112112113).

Subtracting from 2011011011 its reverse (1101101102), we obtain a palindrome (909909909).

It can be divided in two parts, 201101101 and 1, that added together give a palindrome (201101102).

The spelling of 2011011011 in words is "two billion, eleven million, eleven thousand, eleven".