Search a number
-
+
27110141 = 59945259
BaseRepresentation
bin110011101101…
…0101011111101
31220000100010022
41213122223331
523420011031
62405021525
7446301212
oct147325375
956010108
1027110141
1114337283
1290b48a5
135802806
143859b09
1525a797b
hex19daafd

27110141 has 4 divisors (see below), whose sum is σ = 27156000. Its totient is φ = 27064284.

The previous prime is 27110137. The next prime is 27110147. The reversal of 27110141 is 14101172.

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.

It is a cyclic number.

It is not a de Polignac number, because 27110141 - 22 = 27110137 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 227110141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 45858.

The product of its (nonzero) digits is 56, while the sum is 17.

The square root of 27110141 is about 5206.7399589378. The cubic root of 27110141 is about 300.4073761947.

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

Divisors: 1 599 45259 27110141