Search a number
-
+
1100101110111 = 321090311210993
BaseRepresentation
bin10000000000100011001…
…000101100100101011111
310220011112221022200201200
4100000203020230211133
5121011001341010421
62201213544410543
7142323350102133
oct20004310544537
93804487280650
101100101110111
11394606440573
12159259776a53
137c97ba1a143
143b360aa73c3
151d9397c4726
hex1002322c95f

1100101110111 has 12 divisors (see below), whose sum is σ = 1589180821488. Its totient is φ = 733333408704.

The previous prime is 1100101110109. The next prime is 1100101110137. The reversal of 1100101110111 is 1110111010011.

It is not a de Polignac number, because 1100101110111 - 21 = 1100101110109 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 21100101110111 is an apocalyptic number.

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

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

1100101110111 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 1100101110111 its reverse (1110111010011), we get a palindrome (2210212120122).

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

Divisors: 1 3 9 10903 32709 98127 11210993 33632979 100898937 122233456679 366700370037 1100101110111