Search a number
-
+
1131321122213 is a prime number
BaseRepresentation
bin10000011101100111111…
…111100101110110100101
311000011010201021122002012
4100131213333211312211
5122013421201402323
62223415521524005
7144510122605442
oct20354777456645
94004121248065
101131321122213
113a6877309767
121633111a3605
13828b5a92499
143ca831709c9
151e66558d678
hex10767fe5da5

1131321122213 has 2 divisors, whose sum is σ = 1131321122214. Its totient is φ = 1131321122212.

The previous prime is 1131321122153. The next prime is 1131321122273. The reversal of 1131321122213 is 3122211231311.

It is a happy number.

It is a balanced prime because it is at equal distance from previous prime (1131321122153) and next prime (1131321122273).

It can be written as a sum of positive squares in only one way, i.e., 898025360164 + 233295762049 = 947642^2 + 483007^2 .

It is a cyclic number.

It is not a de Polignac number, because 1131321122213 - 26 = 1131321122149 is a prime.

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 (1131321122273) by changing a digit.

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

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

Almost surely, 21131321122213 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1131321122213 its reverse (3122211231311), we get a palindrome (4253532353524).

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