Search a number
11050 = 2521317
BaseRepresentation
bin10101100101010
3120011021
42230222
5323200
6123054
744134
oct25452
916137
1011050
118336
12648a
135050
144054
15341a
hex2b2a

11050 has 24 divisors (see below), whose sum is σ = 23436. Its totient is φ = 3840.

The previous prime is 11047. The next prime is 11057. The reversal of 11050 is 5011.

11050 is nontrivially palindromic in base 8.

11050 is digitally balanced in base 2 and base 6, because in such bases it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 6 ways, for example, as 3481 + 7569 = 59^2 + 87^2 .

11050 is an undulating number in base 13.

11050 is strictly pandigital in base 6.

It is a congruent number.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 642 + ... + 658.

211050 is an apocalyptic number.

11050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

11050 is an abundant number, since it is smaller than the sum of its proper divisors (12386).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

It is a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11718).

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

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

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

The product of its (nonzero) digits is 5, while the sum is 7.

The square root of 11050 is about 105.1189802081. The cubic root of 11050 is about 22.2734466467.

Adding to 11050 its reverse (5011), we get a palindrome (16061).

The spelling of 11050 in words is "eleven thousand, fifty".