Search a number
-
+
10110000021111 = 321959122807141
BaseRepresentation
bin1001001100011110101011…
…1101011011111001110111
31022210111200021200022011100
42103013222331123321313
52311120240001133421
633300245255141143
72062265140163304
oct223075275337167
938714607608140
1010110000021111
113248699498a81
1211734766747b3
135844a4661c03
1426d48031a0ab
15127eb7041c26
hex931eaf5be77

10110000021111 has 12 divisors (see below), whose sum is σ = 15371929856920. Its totient is φ = 6385263171120.

The previous prime is 10110000021103. The next prime is 10110000021137. The reversal of 10110000021111 is 11112000001101.

It is not a de Polignac number, because 10110000021111 - 23 = 10110000021103 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 10110000021093 and 10110000021102.

It is a congruent number.

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

Almost surely, 210110000021111 is an apocalyptic number.

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

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

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

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

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

Adding to 10110000021111 its reverse (11112000001101), we get a palindrome (21222000022212).

The spelling of 10110000021111 in words is "ten trillion, one hundred ten billion, twenty-one thousand, one hundred eleven".

Divisors: 1 3 9 19 57 171 59122807141 177368421423 532105264269 1123333335679 3370000007037 10110000021111