Search a number
-
+
110141 = 831327
BaseRepresentation
bin11010111000111101
312121002022
4122320331
512011031
62205525
7636053
oct327075
9177068
10110141
1175829
12538a5
133b195
142c1d3
152297b
hex1ae3d

110141 has 4 divisors (see below), whose sum is σ = 111552. Its totient is φ = 108732.

The previous prime is 110129. The next prime is 110161. The reversal of 110141 is 141011.

Adding to 110141 its reverse (141011), we get a palindrome (251152).

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 141011 = 1310847.

It is a cyclic number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110161) 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 in 3 ways as a sum of consecutive naturals, for example, 581 + ... + 746.

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

2110141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1410.

The product of its (nonzero) digits is 4, while the sum is 8.

The square root of 110141 is about 331.8749764595. The cubic root of 110141 is about 47.9346622598.

The spelling of 110141 in words is "one hundred ten thousand, one hundred forty-one", and thus it is an iban number.

Divisors: 1 83 1327 110141