Search a number
-
+
110212200110 = 25102761107251
BaseRepresentation
bin110011010100100101…
…0001011011010101110
3101112110212200212012102
41212221022023122232
53301203310400420
6122344125535102
710651106146445
oct1465112133256
9345425625172
10110212200110
1142816a06201
1219439a14492
13a5154662bc
14549745dd5c
152d00a61a75
hex19a928b6ae

110212200110 has 16 divisors (see below), whose sum is σ = 198385740432. Its totient is φ = 44084040000.

The previous prime is 110212200083. The next prime is 110212200143. The reversal of 110212200110 is 11002212011.

It is a Curzon number.

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

It is a congruent number.

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 7 ways as a sum of consecutive naturals, for example, 973985 + ... + 1081235.

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

Almost surely, 2110212200110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 210019.

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

Adding to 110212200110 its reverse (11002212011), we get a palindrome (121214412121).

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

Divisors: 1 2 5 10 102761 107251 205522 214502 513805 536255 1027610 1072510 11021220011 22042440022 55106100055 110212200110