Search a number
-
+
110220021111 = 3367990110111
BaseRepresentation
bin110011010100110100…
…0000000110101110111
3101112111102102012121010
41212221220000311313
53301212311133421
6122345005323303
710651232502264
oct1465150006567
9345442365533
10110220021111
1142820368242
1219440566533
13a516c74105
1454984d826b
152d015a9076
hex19a9a00d77

110220021111 has 16 divisors (see below), whose sum is σ = 147389923328. Its totient is φ = 73265148000.

The previous prime is 110220021097. The next prime is 110220021157. The reversal of 110220021111 is 111120022011.

It is not a de Polignac number, because 110220021111 - 210 = 110220020087 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10895946 + ... + 10906056.

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

Almost surely, 2110220021111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 20382.

The product of its (nonzero) digits is 8, while the sum is 12.

Adding to 110220021111 its reverse (111120022011), we get a palindrome (221340043122).

The spelling of 110220021111 in words is "one hundred ten billion, two hundred twenty million, twenty-one thousand, one hundred eleven".

Divisors: 1 3 367 1101 9901 10111 29703 30333 3633667 3710737 10901001 11132211 100109011 300327033 36740007037 110220021111