Search a number
-
+
11050131 = 329157809
BaseRepresentation
bin101010001001…
…110010010011
3202210101221010
4222021302103
510312101011
61032502003
7162632061
oct52116223
922711833
1011050131
116268144
12384a903
13239b851
141679031
15e841a6
hexa89c93

11050131 has 16 divisors (see below), whose sum is σ = 15357600. Its totient is φ = 7058688.

The previous prime is 11050111. The next prime is 11050139. The reversal of 11050131 is 13105011.

11050131 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 11050131 - 25 = 11050099 is a prime.

It is a super-2 number, since 2×110501312 = 244210790234322, which contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (11050139) 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 15 ways as a sum of consecutive naturals, for example, 13255 + ... + 14063.

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

Almost surely, 211050131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 998.

The product of its (nonzero) digits is 15, while the sum is 12.

The square root of 11050131 is about 3324.1737319220. The cubic root of 11050131 is about 222.7353466511.

Adding to 11050131 its reverse (13105011), we get a palindrome (24155142).

The spelling of 11050131 in words is "eleven million, fifty thousand, one hundred thirty-one".

Divisors: 1 3 29 87 157 471 809 2427 4553 13659 23461 70383 127013 381039 3683377 11050131