Search a number
-
+
1111000101111 = 354572016877
BaseRepresentation
bin10000001010101100110…
…001000011000011110111
310221012200111200210200000
4100022230301003003313
5121200312011213421
62210215243522343
7143160422021115
oct20125461030367
93835614623600
101111000101111
1139919965884a
1215b39b8293b3
13809c7a39944
143bab63a2ab5
151dd76560226
hex102acc430f7

1111000101111 has 12 divisors (see below), whose sum is σ = 1664214143592. Its totient is φ = 740666733912.

The previous prime is 1111000101103. The next prime is 1111000101131. The reversal of 1111000101111 is 1111010001111.

It is not a de Polignac number, because 1111000101111 - 23 = 1111000101103 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 = 1111000101093 and 1111000101102.

It is a congruent number.

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

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

Almost surely, 21111000101111 is an apocalyptic number.

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

1111000101111 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 1111000101111 its reverse (1111010001111), we get a palindrome (2222010102222).

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

Divisors: 1 3 9 27 81 243 4572016877 13716050631 41148151893 123444455679 370333367037 1111000101111