Search a number
-
+
11011122323213 is a prime number
BaseRepresentation
bin1010000000111011101000…
…0010001101111100001101
31102222122122001021020110012
42200032322002031330031
52420401234303320323
635230234553323005
72214345606314525
oct240167202157415
942878561236405
1011011122323213
113565877545a71
12129a042706465
1361b4627a9bac
142a0d267a8685
15141657d5c678
hexa03ba08df0d

11011122323213 has 2 divisors, whose sum is σ = 11011122323214. Its totient is φ = 11011122323212.

The previous prime is 11011122323209. The next prime is 11011122323231. The reversal of 11011122323213 is 31232322111011.

It is a happy number.

Together with next prime (11011122323231) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9991048583044 + 1020073740169 = 3160862^2 + 1009987^2 .

It is a cyclic number.

It is not a de Polignac number, because 11011122323213 - 22 = 11011122323209 is a prime.

It is a congruent number.

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

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

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

Almost surely, 211011122323213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 432, while the sum is 23.

Adding to 11011122323213 its reverse (31232322111011), we get a palindrome (42243444434224).

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