Search a number
-
+
1102200110210 = 25461239088961
BaseRepresentation
bin10000000010100000001…
…111101111110010000010
310220100222012221221120002
4100002200033233302002
5121024301212011320
62202202125320002
7142426355233013
oct20024017576202
93810865857502
101102200110210
113954932563a1
12159744706002
137cc24847b34
143b4bd77300a
151da0dbe0675
hex100a03efc82

1102200110210 has 16 divisors (see below), whose sum is σ = 1988263807992. Its totient is φ = 439923686400.

The previous prime is 1102200110177. The next prime is 1102200110227. The reversal of 1102200110210 is 120110022011.

It can be written as a sum of positive squares in 4 ways, for example, as 511821483889 + 590378626321 = 715417^2 + 768361^2 .

It is a super-2 number, since 2×11022001102102 (a number of 25 digits) contains 22 as substring.

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

It is an unprimeable number.

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

Almost surely, 21102200110210 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 239089429.

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

Adding to 1102200110210 its reverse (120110022011), we get a palindrome (1222310132221).

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

Divisors: 1 2 5 10 461 922 2305 4610 239088961 478177922 1195444805 2390889610 110220011021 220440022042 551100055105 1102200110210