Search a number
-
+
1111101000111 = 3341151888893
BaseRepresentation
bin10000001010110010110…
…001111100100110101111
310221012221112120000002000
4100022302301330212233
5121201013324000421
62210233250303343
7143163055446234
oct20126261744657
93835845500060
101111101000111
11399240603753
1215b409587b53
1380a129066ab
143bac594978b
151dd80341226
hex102b2c7c9af

1111101000111 has 8 divisors (see below), whose sum is σ = 1646075555760. Its totient is φ = 740734000056.

The previous prime is 1111101000091. The next prime is 1111101000161. The reversal of 1111101000111 is 1110001011111.

It is not a de Polignac number, because 1111101000111 - 213 = 1111100991919 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 = 1111101000093 and 1111101000102.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20575944420 + ... + 20575944473.

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

Almost surely, 21111101000111 is an apocalyptic number.

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

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

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

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

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

Adding to 1111101000111 its reverse (1110001011111), we get a palindrome (2221102011222).

The spelling of 1111101000111 in words is "one trillion, one hundred eleven billion, one hundred one million, one hundred eleven", and thus it is an aban number.

Divisors: 1 3 9 27 41151888893 123455666679 370367000037 1111101000111