Search a number
-
+
23110141 is a prime number
BaseRepresentation
bin101100000101…
…0000111111101
31121111010011011
41120022013331
521404011031
62143155221
7400301335
oct130120775
947433134
1023110141
1112054a9a
1278a5b11
134a31c52
1430d80c5
1520676b1
hex160a1fd

23110141 has 2 divisors, whose sum is σ = 23110142. Its totient is φ = 23110140.

The previous prime is 23110133. The next prime is 23110151. The reversal of 23110141 is 14101132.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 21068100 + 2042041 = 4590^2 + 1429^2 .

It is a cyclic number.

It is not a de Polignac number, because 23110141 - 23 = 23110133 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 223110141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 24, while the sum is 13.

The square root of 23110141 is about 4807.3008019054. The cubic root of 23110141 is about 284.8399265251.

Adding to 23110141 its reverse (14101132), we get a palindrome (37211273).

Subtracting from 23110141 its reverse (14101132), we obtain a palindrome (9009009).

The spelling of 23110141 in words is "twenty-three million, one hundred ten thousand, one hundred forty-one".