Search a number
-
+
11010010001131 is a prime number
BaseRepresentation
bin1010000000110111011110…
…1111000010111011101011
31102222112202112020102102001
42200031313233002323223
52420342000030014011
635225532340351431
72214306211611151
oct240156757027353
942875675212361
1011010010001131
113565356684a19
1212999920a5577
1361b31620374b
142a0c5cb7d3d1
151415e03907c1
hexa0377bc2eeb

11010010001131 has 2 divisors, whose sum is σ = 11010010001132. Its totient is φ = 11010010001130.

The previous prime is 11010010001083. The next prime is 11010010001141. The reversal of 11010010001131 is 13110001001011.

It is an a-pointer prime, because the next prime (11010010001141) can be obtained adding 11010010001131 to its sum of digits (10).

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11010010001131 is a prime.

It is a super-2 number, since 2×110100100011312 (a number of 27 digits) contains 22 as substring.

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

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

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

Almost surely, 211010010001131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 11010010001131 its reverse (13110001001011), we get a palindrome (24120011002142).

The spelling of 11010010001131 in words is "eleven trillion, ten billion, ten million, one thousand, one hundred thirty-one".