Search a number
-
+
11012211110 = 251101221111
BaseRepresentation
bin10100100000110000…
…10000000110100110
31001102110102021201202
422100120100012212
5140023111223420
65020421522502
7536615151515
oct122030200646
931373367652
1011012211110
11474111921a
122173b73432
131066611764
1476676c67c
15446ba2575
hex2906101a6

11012211110 has 8 divisors (see below), whose sum is σ = 19821980016. Its totient is φ = 4404884440.

The previous prime is 11012211109. The next prime is 11012211131. The reversal of 11012211110 is 1111221011.

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 550610546 + ... + 550610565.

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

Almost surely, 211012211110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1101221118.

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

Adding to 11012211110 its reverse (1111221011), we get a palindrome (12123432121).

Subtracting from 11012211110 its reverse (1111221011), we obtain a palindrome (9900990099).

The spelling of 11012211110 in words is "eleven billion, twelve million, two hundred eleven thousand, one hundred ten".

Divisors: 1 2 5 10 1101221111 2202442222 5506105555 11012211110