Search a number
-
+
11120110011 = 321641175289
BaseRepresentation
bin10100101101100111…
…10110100110111011
31001200222110010012100
422112303312212323
5140233222010021
65035234314443
7542365242543
oct122663664673
931628403170
1011120110011
11479701526a
1221a4128a23
131082a8c66a
14776c18323
154513b7626
hex296cf69bb

11120110011 has 12 divisors (see below), whose sum is σ = 16063573240. Its totient is φ = 7412856480.

The previous prime is 11120110009. The next prime is 11120110013. The reversal of 11120110011 is 11001102111.

It is an interprime number because it is at equal distance from previous prime (11120110009) and next prime (11120110013).

It is not a de Polignac number, because 11120110011 - 21 = 11120110009 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 11120109975 and 11120110002.

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

Almost surely, 211120110011 is an apocalyptic number.

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

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

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

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

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

Adding to 11120110011 its reverse (11001102111), we get a palindrome (22121212122).

The spelling of 11120110011 in words is "eleven billion, one hundred twenty million, one hundred ten thousand, eleven".

Divisors: 1 3 9 16411 49233 75289 147699 225867 677601 1235567779 3706703337 11120110011