Search a number
-
+
10100110110111 = 327160319208097
BaseRepresentation
bin1001001011111001110101…
…1110011010110110011111
31022202120011001001202202100
42102332131132122312133
52310440011142010421
633251532044100143
72061465100263450
oct222763536326637
938676131052670
1010100110110111
11324448393650a
121171576534653
1358358970b478
1426cbc2a53127
15127ad8b7cc26
hex92f9d79ad9f

10100110110111 has 12 divisors (see below), whose sum is σ = 16673197642192. Its totient is φ = 5771491491456.

The previous prime is 10100110110037. The next prime is 10100110110119. The reversal of 10100110110111 is 11101101100101.

It is not a de Polignac number, because 10100110110111 - 210 = 10100110109087 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 = 10100110110093 and 10100110110102.

It is a congruent number.

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

Almost surely, 210100110110111 is an apocalyptic number.

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

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

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

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

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

Adding to 10100110110111 its reverse (11101101100101), we get a palindrome (21201211210212).

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

Divisors: 1 3 7 9 21 63 160319208097 480957624291 1122234456679 1442872872873 3366703370037 10100110110111