Search a number
-
+
1131340511137 is a prime number
BaseRepresentation
bin10000011101101001001…
…001100011011110100001
311000011012001202200200111
4100131221021203132201
5122013441132324022
62223421453251321
7144510446451064
oct20355111433641
94004161680614
101131340511137
113a6887251971
12163317793b41
13828b9ac0715
143ca8597a8db
151e66711d477
hex107692637a1

1131340511137 has 2 divisors, whose sum is σ = 1131340511138. Its totient is φ = 1131340511136.

The previous prime is 1131340511131. The next prime is 1131340511149. The reversal of 1131340511137 is 7311150431311.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1069702021696 + 61638489441 = 1034264^2 + 248271^2 .

It is a cyclic number.

It is not a de Polignac number, because 1131340511137 - 227 = 1131206293409 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (1131340511131) 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, 565670255568 + 565670255569.

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

Almost surely, 21131340511137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3780, while the sum is 31.

Adding to 1131340511137 its reverse (7311150431311), we get a palindrome (8442490942448).

The spelling of 1131340511137 in words is "one trillion, one hundred thirty-one billion, three hundred forty million, five hundred eleven thousand, one hundred thirty-seven".