Search a number
-
+
1100111011111 = 7157158715873
BaseRepresentation
bin10000000000100011101…
…110011101110100100111
310220011120121221201100101
4100000203232131310213
5121011011404323421
62201214540524531
7142323530210050
oct20004356356447
93804517851311
101100111011111
11394610a93312
12159260b50747
137c980aa5918
143b362123727
151d93a5cd191
hex10023b9dd27

1100111011111 has 4 divisors (see below), whose sum is σ = 1257269726992. Its totient is φ = 942952295232.

The previous prime is 1100111011091. The next prime is 1100111011169. The reversal of 1100111011111 is 1111101110011.

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 1100111011111 - 219 = 1100110486823 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 21100111011111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 157158715880.

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

Adding to 1100111011111 its reverse (1111101110011), we get a palindrome (2211212121122).

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

Divisors: 1 7 157158715873 1100111011111