Search a number
-
+
11001512132 = 2213211567541
BaseRepresentation
bin10100011111011110…
…11100000011000100
31001101201021201111022
422033233130003010
5140012341342012
65015400330312
7536425211252
oct121757340304
931351251438
1011001512132
114736080996
122170473998
1310643369c0
147651855d2
15445c8c472
hex28fbdc0c4

11001512132 has 12 divisors (see below), whose sum is σ = 20733619116. Its totient is φ = 5077620960.

The previous prime is 11001512131. The next prime is 11001512149. The reversal of 11001512132 is 23121510011.

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

It can be written as a sum of positive squares in 2 ways, for example, as 5088824896 + 5912687236 = 71336^2 + 76894^2 .

It is a self number, because there is not a number n which added to its sum of digits gives 11001512132.

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

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

Almost surely, 211001512132 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 60, while the sum is 17.

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

Divisors: 1 2 4 13 26 52 211567541 423135082 846270164 2750378033 5500756066 11001512132