Search a number
-
+
11032132011 = 347711102001
BaseRepresentation
bin10100100011001000…
…01111100110101011
31001110211220101001220
422101210033212223
5140043211211021
65022412513123
7540246401115
oct122144174653
931424811056
1011032132011
11475139507a
12217a77b7a3
13106a797b84
147692763b5
154487d9cc6
hex29190f9ab

11032132011 has 16 divisors (see below), whose sum is σ = 15234075648. Its totient is φ = 7096880000.

The previous prime is 11032132009. The next prime is 11032132061. The reversal of 11032132011 is 11023123011.

It is a happy number.

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

It is a cyclic number.

It is not a de Polignac number, because 11032132011 - 21 = 11032132009 is a prime.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 540990 + ... + 561011.

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

Almost surely, 211032132011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1102122.

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

Adding to 11032132011 its reverse (11023123011), we get a palindrome (22055255022).

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

Divisors: 1 3 47 71 141 213 3337 10011 1102001 3306003 51794047 78242071 155382141 234726213 3677377337 11032132011