Search a number
100111101111 = 32713918616143
BaseRepresentation
bin101110100111100010…
…1100010110010110111
3100120101220200212022200
41131033011202302313
53120011420213421
6113553532155543
710142563214310
oct1351705426267
9316356625280
10100111101111
1139503119aaa
121749b008bb3
13959583c048
144bb9b01607
15290dd83726
hex174f162cb7

100111101111 has 48 divisors (see below), whose sum is σ = 166568263680. Its totient is φ = 56755028160.

The previous prime is 100111101107. The next prime is 100111101127. The reversal of 100111101111 is 111101111001.

It is not a de Polignac number, because 100111101111 - 22 = 100111101107 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 = 100111101093 and 100111101102.

It is a congruent number.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 16293706 + ... + 16299848.

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

Almost surely, 2100111101111 is an apocalyptic number.

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

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

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

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

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

Adding to 100111101111 its reverse (111101111001), we get a palindrome (211212212112).

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