Search a number
-
+
12011141 = 711671013
BaseRepresentation
bin101101110100…
…011010000101
3211121020012002
4231310122011
511033324031
61105235045
7204043622
oct55643205
924536162
1012011141
11686416a
124032a85
1326470ac
141849349
1510c3ccb
hexb74685

12011141 has 8 divisors (see below), whose sum is σ = 12265344. Its totient is φ = 11759440.

The previous prime is 12011123. The next prime is 12011143. The reversal of 12011141 is 14111021.

12011141 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 a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

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

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (12011143) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11351 + ... + 12363.

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

Almost surely, 212011141 is an apocalyptic number.

It is an amenable number.

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

12011141 is a wasteful number, since it uses less digits than its factorization.

12011141 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1251.

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

The square root of 12011141 is about 3465.7093069096. The cubic root of 12011141 is about 229.0136780475.

Adding to 12011141 its reverse (14111021), we get a palindrome (26122162).

The spelling of 12011141 in words is "twelve million, eleven thousand, one hundred forty-one".

Divisors: 1 71 167 1013 11857 71923 169171 12011141