Search a number
-
+
11510161310261 is a prime number
BaseRepresentation
bin1010011101111110101100…
…0100111000001000110101
31111202100201221011102202102
42213133223010320020311
53002040302243412021
640251410050551445
72265403345602155
oct247375304701065
944670657142672
1011510161310261
113738482a99189
12135a8b5898585
136565327bb243
142bb14810c765
1514e61441100b
hexa77eb138235

11510161310261 has 2 divisors, whose sum is σ = 11510161310262. Its totient is φ = 11510161310260.

The previous prime is 11510161310237. The next prime is 11510161310269. The reversal of 11510161310261 is 16201316101511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8830965229636 + 2679196080625 = 2971694^2 + 1636825^2 .

It is a cyclic number.

It is not a de Polignac number, because 11510161310261 - 210 = 11510161309237 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 211510161310261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1080, while the sum is 29.

Adding to 11510161310261 its reverse (16201316101511), we get a palindrome (27711477411772).

The spelling of 11510161310261 in words is "eleven trillion, five hundred ten billion, one hundred sixty-one million, three hundred ten thousand, two hundred sixty-one".