Search a number
-
+
2011321334213 is a prime number
BaseRepresentation
bin11101010001001100000…
…101111111100111000101
321010021120102221012212122
4131101030011333213011
5230423141230143323
64135553244255325
7265212263154242
oct35211405774705
97107512835778
102011321334213
11705aa6504844
12285983541545
13117888c192b9
146d4c42c85c9
15374bbd91ec8
hex1d44c17f9c5

2011321334213 has 2 divisors, whose sum is σ = 2011321334214. Its totient is φ = 2011321334212.

The previous prime is 2011321334189. The next prime is 2011321334219. The reversal of 2011321334213 is 3124331231102.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1945193668804 + 66127665409 = 1394702^2 + 257153^2 .

It is a cyclic number.

It is not a de Polignac number, because 2011321334213 - 26 = 2011321334149 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 22011321334213 is an apocalyptic number.

It is an amenable number.

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

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

2011321334213 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 2592, while the sum is 26.

Adding to 2011321334213 its reverse (3124331231102), we get a palindrome (5135652565315).

The spelling of 2011321334213 in words is "two trillion, eleven billion, three hundred twenty-one million, three hundred thirty-four thousand, two hundred thirteen".