Search a number
-
+
10110011001131 is a prime number
BaseRepresentation
bin1001001100011110101110…
…0111010100100100101011
31022210111201001100010220202
42103013223213110210223
52311120300304014011
633300250330342415
72062265332414106
oct223075347244453
938714631303822
1010110011001131
1132486a4708478
12117347a28aa0b
135844a6a07872
1426d48197773d
15127eb7eb023b
hex931eb9d492b

10110011001131 has 2 divisors, whose sum is σ = 10110011001132. Its totient is φ = 10110011001130.

The previous prime is 10110011001071. The next prime is 10110011001137. The reversal of 10110011001131 is 13110011001101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10110011001131 - 210 = 10110011000107 is a prime.

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

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

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

Almost surely, 210110011001131 is an apocalyptic number.

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

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

10110011001131 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 11.

Adding to 10110011001131 its reverse (13110011001101), we get a palindrome (23220022002232).

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