Search a number
-
+
11102111210 = 251110211121
BaseRepresentation
bin10100101011011110…
…01100010111101010
31001122201120200111002
422111233030113222
5140214120024320
65033352435002
7542056250111
oct122557142752
931581520432
1011102111210
114787941523
12219a0a8a62
13107c12a098
14774690c78
1544ea0e675
hex295bcc5ea

11102111210 has 8 divisors (see below), whose sum is σ = 19983800196. Its totient is φ = 4440844480.

The previous prime is 11102111197. The next prime is 11102111221. The reversal of 11102111210 is 1211120111.

It can be written as a sum of positive squares in 2 ways, for example, as 11094198241 + 7912969 = 105329^2 + 2813^2 .

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 = 11102111191 and 11102111200.

It is an unprimeable number.

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

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

Almost surely, 211102111210 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1110211128.

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

Adding to 11102111210 its reverse (1211120111), we get a palindrome (12313231321).

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

Divisors: 1 2 5 10 1110211121 2220422242 5551055605 11102111210