Search a number
-
+
111100020111 = 3223536715073
BaseRepresentation
bin110011101111000010…
…0111100010110001111
3101121202202021210021200
41213132010330112033
53310013101120421
6123012203000543
711012106406113
oct1473604742617
9347682253250
10111100020111
1143132079543
1219647209153
13a627386a92
14553d329743
152d53984726
hex19de13c58f

111100020111 has 12 divisors (see below), whose sum is σ = 167455103088. Its totient is φ = 70846389504.

The previous prime is 111100020103. The next prime is 111100020113. The reversal of 111100020111 is 111020001111.

It is not a de Polignac number, because 111100020111 - 23 = 111100020103 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 = 111100020093 and 111100020102.

It is a congruent number.

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

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

Almost surely, 2111100020111 is an apocalyptic number.

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

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

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

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

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

Adding to 111100020111 its reverse (111020001111), we get a palindrome (222120021222).

The spelling of 111100020111 in words is "one hundred eleven billion, one hundred million, twenty thousand, one hundred eleven".

Divisors: 1 3 9 23 69 207 536715073 1610145219 4830435657 12344446679 37033340037 111100020111