Search a number
-
+
10110200131 is a prime number
BaseRepresentation
bin10010110101001110…
…10110100101000011
3222002121010101021201
421122213112211003
5131201202401011
64351120402031
7505353166063
oct113247264503
928077111251
1010110200131
114318a42aa9
121b61a76317
13c51792955
146bca4b3a3
153e28c9cc1
hex25a9d6943

10110200131 has 2 divisors, whose sum is σ = 10110200132. Its totient is φ = 10110200130.

The previous prime is 10110200117. The next prime is 10110200141. The reversal of 10110200131 is 13100201101.

10110200131 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10110200131 - 211 = 10110198083 is a prime.

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

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

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

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

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

Almost surely, 210110200131 is an apocalyptic number.

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

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

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

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

Adding to 10110200131 its reverse (13100201101), we get a palindrome (23210401232).

The spelling of 10110200131 in words is "ten billion, one hundred ten million, two hundred thousand, one hundred thirty-one".