Search a number
-
+
1100002111111 = 10110891110011
BaseRepresentation
bin10000000000011101001…
…111000010111010000111
310220011022001001000122001
4100000131033002322013
5121010301020023421
62201200050450131
7142321035446251
oct20003517027207
93804261030561
101100002111111
11394565573112
12159230593947
137c964367157
143b351896cd1
151d930c6b691
hex1001d3c2e87

1100002111111 has 4 divisors (see below), whose sum is σ = 1110893221224. Its totient is φ = 1089111001000.

The previous prime is 1100002111097. The next prime is 1100002111171. The reversal of 1100002111111 is 1111112000011.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1100002111111 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 (1100002111171) by changing a digit.

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

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

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

Almost surely, 21100002111111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 10891110112.

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

Adding to 1100002111111 its reverse (1111112000011), we get a palindrome (2211114111122).

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

Divisors: 1 101 10891110011 1100002111111