Search a number
-
+
10110131 is a prime number
BaseRepresentation
bin100110100100…
…010010110011
3201000122111022
4212210102303
510042011011
61000410055
7151635413
oct46442263
921018438
1010110131
115785989
12347692b
13212ca35
1414b2643
15d4a8db
hex9a44b3

10110131 has 2 divisors, whose sum is σ = 10110132. Its totient is φ = 10110130.

The previous prime is 10110119. The next prime is 10110137. The reversal of 10110131 is 13101101.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10110131 - 214 = 10093747 is a prime.

It is a super-2 number, since 2×101101312 = 204429497674322, which contains 22 as substring.

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

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

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

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

Almost surely, 210110131 is an apocalyptic number.

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

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

10110131 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 8.

The square root of 10110131 is about 3179.6432189791. The cubic root of 10110131 is about 216.2314833734.

Adding to 10110131 its reverse (13101101), we get a palindrome (23211232).

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