Search a number
-
+
2111008021 is a prime number
BaseRepresentation
bin111110111010011…
…0110110100010101
312110010020022121021
41331310312310111
513310404224041
6545250121141
7103212162223
oct17564666425
95403208537
102111008021
11993677631
124aab801b1
13278473495
14160513b13
15c54ddcd1
hex7dd36d15

2111008021 has 2 divisors, whose sum is σ = 2111008022. Its totient is φ = 2111008020.

The previous prime is 2111008019. The next prime is 2111008033. The reversal of 2111008021 is 1208001112.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2009280625 + 101727396 = 44825^2 + 10086^2 .

It is a cyclic number.

It is not a de Polignac number, because 2111008021 - 21 = 2111008019 is a prime.

Together with 2111008019, it forms a pair of twin primes.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (2111008001) 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 as a sum of consecutive naturals, namely, 1055504010 + 1055504011.

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

Almost surely, 22111008021 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 32, while the sum is 16.

The square root of 2111008021 is about 45945.7073185298. The cubic root of 2111008021 is about 1282.8128289063.

Adding to 2111008021 its reverse (1208001112), we get a palindrome (3319009133).

The spelling of 2111008021 in words is "two billion, one hundred eleven million, eight thousand, twenty-one".