Search a number
-
+
11000101111 = 22034993237
BaseRepresentation
bin10100011111010100…
…00011100011110111
31001101121122000221021
422033222003203313
5140012011213421
65015310202011
7536410213426
oct121752034367
931347560837
1011000101111
1147352a785a
12216bab3307
131063c6168c
14764cd92bd
15445aae341
hex28fa838f7

11000101111 has 4 divisors (see below), whose sum is σ = 11005096552. Its totient is φ = 10995105672.

The previous prime is 11000101087. The next prime is 11000101117. The reversal of 11000101111 is 11110100011.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 11000101111 - 219 = 10999576823 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2494416 + ... + 2498821.

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

Almost surely, 211000101111 is an apocalyptic number.

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

11000101111 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 4995440.

The product of its (nonzero) digits is 1, while the sum is 7.

Adding to 11000101111 its reverse (11110100011), we get a palindrome (22110201122).

The spelling of 11000101111 in words is "eleven billion, one hundred one thousand, one hundred eleven".

Divisors: 1 2203 4993237 11000101111