Cookie Consent by FreePrivacyPolicy.com
Search a number
-
+
11061 = 321229
BaseRepresentation
bin10101100110101
3120011200
42230311
5323221
6123113
744151
oct25465
916150
1011061
118346
126499
13505b
144061
153426
hex2b35

11061 has 6 divisors (see below), whose sum is σ = 15990. Its totient is φ = 7368.

The previous prime is 11059. The next prime is 11069. The reversal of 11061 is 16011.

11061 is nontrivially palindromic in base 2.

It can be written as a sum of positive squares in only one way, i.e., 11025 + 36 = 105^2 + 6^2 .

It is not a de Polignac number, because 11061 - 21 = 11059 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1229 = 11061 / (1 + 1 + 0 + 6 + 1).

It is a Curzon number.

It is a congruent number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 606 + ... + 623.

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

211061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1235 (or 1232 counting only the distinct ones).

The product of its (nonzero) digits is 6, while the sum is 9.

The square root of 11061 is about 105.1712888577. The cubic root of 11061 is about 22.2808350829.

Adding to 11061 its reverse (16011), we get a palindrome (27072).

Subtracting 11061 from its reverse (16011), we obtain a triangular number (4950 = T99).

It can be divided in two parts, 110 and 61, that added together give a palindrome (171).

The spelling of 11061 in words is "eleven thousand, sixty-one".

Divisors: 1 3 9 1229 3687 11061