Search a number
-
+
11011131 = 321223459
BaseRepresentation
bin101010000000…
…010000111011
3202201102102200
4222000100323
510304324011
61032001243
7162410265
oct52002073
922642380
1011011131
11624090a
123830223
132386b81
141668b35
15e77856
hexa8043b

11011131 has 6 divisors (see below), whose sum is σ = 15904980. Its totient is φ = 7340748.

The previous prime is 11011123. The next prime is 11011141. The reversal of 11011131 is 13111011.

It is not a de Polignac number, because 11011131 - 23 = 11011123 is a prime.

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

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: 1223459 = 11011131 / (1 + 1 + 0 + 1 + 1 + 1 + 3 + 1).

It is not an unprimeable number, because it can be changed into a prime (11011141) 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, 611721 + ... + 611738.

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

Almost surely, 211011131 is an apocalyptic number.

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

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

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

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

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

The square root of 11011131 is about 3318.3024274469. The cubic root of 11011131 is about 222.4729992906.

Adding to 11011131 its reverse (13111011), we get a palindrome (24122142).

It can be divided in two parts, 11011 and 131, that multiplied together give a palindrome (1442441).

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

Divisors: 1 3 9 1223459 3670377 11011131