Search a number
-
+
110220102110 = 2511022010211
BaseRepresentation
bin110011010100110100…
…0010100100111011110
3101112111102120022201002
41212221220110213132
53301212321231420
6122345011150302
710651233260366
oct1465150244736
9345442508632
10110220102110
1142820413088
12194405a5392
13a516ca1c41
1454985199a6
152d015c3075
hex19a9a149de

110220102110 has 8 divisors (see below), whose sum is σ = 198396183816. Its totient is φ = 44088040840.

The previous prime is 110220102079. The next prime is 110220102131. The reversal of 110220102110 is 11201022011.

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

It is a Curzon number.

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

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

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

Almost surely, 2110220102110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 11022010218.

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

Adding to 110220102110 its reverse (11201022011), we get a palindrome (121421124121).

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

Divisors: 1 2 5 10 11022010211 22044020422 55110051055 110220102110