Search a number
-
+
11000011131 = 322011607769
BaseRepresentation
bin10100011111010011…
…01101100101111011
31001101121110110111200
422033221231211323
5140012000324011
65015304225243
7536406360204
oct121751554573
931347413450
1011000011131
11473524619a
12216ba6b223
131063c2c735
14764cb45ab
15445a92856
hex28fa6d97b

11000011131 has 12 divisors (see below), whose sum is σ = 15896832120. Its totient is φ = 7329682080.

The previous prime is 11000011129. The next prime is 11000011151. The reversal of 11000011131 is 13111000011.

It is not a de Polignac number, because 11000011131 - 21 = 11000011129 is a prime.

It is a super-2 number, since 2×110000111312 (a number of 21 digits) contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

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

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

Almost surely, 211000011131 is an apocalyptic number.

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

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

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

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

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

Adding to 11000011131 its reverse (13111000011), we get a palindrome (24111011142).

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

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

Divisors: 1 3 9 2011 6033 18099 607769 1823307 5469921 1222223459 3666670377 11000011131