Search a number
-
+
11022210110 = 258631277197
BaseRepresentation
bin10100100001111100…
…11001010000111110
31001110011020021210002
422100332121100332
5140033141210420
65021420114302
7540066145232
oct122076312076
931404207702
1011022210110
11474682865a
122177395992
131068702a22
14767c125c2
154479ca075
hex290f9943e

11022210110 has 16 divisors (see below), whose sum is σ = 19862983296. Its totient is φ = 4403771808.

The previous prime is 11022210097. The next prime is 11022210161. The reversal of 11022210110 is 1101222011.

11022210110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 629969 + ... + 647228.

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

Almost surely, 211022210110 is an apocalyptic number.

11022210110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1278067.

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

Adding to 11022210110 its reverse (1101222011), we get a palindrome (12123432121).

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

Divisors: 1 2 5 10 863 1726 4315 8630 1277197 2554394 6385985 12771970 1102221011 2204442022 5511105055 11022210110