Search a number
-
+
2011100101111 = 7937253382903
BaseRepresentation
bin11101010000111110111…
…010000011100111110111
321010021000000122102010001
4131100332322003213313
5230422213111213421
64135515302412131
7265203635543623
oct35207672034767
97107000572101
102011100101111
117059a263a072
12285921431047
1311785213953a
146d4a2b7a183
15374a7741691
hex1d43ee839f7

2011100101111 has 4 divisors (see below), whose sum is σ = 2011353491952. Its totient is φ = 2010846710272.

The previous prime is 2011100101093. The next prime is 2011100101177. The reversal of 2011100101111 is 1111010011102.

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-2011100101111 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 (2011100101211) by changing a digit.

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

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

Almost surely, 22011100101111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 253390840.

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

Adding to 2011100101111 its reverse (1111010011102), we get a palindrome (3122110112213).

Subtracting from 2011100101111 its reverse (1111010011102), we obtain a palindrome (900090090009).

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

Divisors: 1 7937 253382903 2011100101111