Search a number
-
+
110020100110 = 2519009578779
BaseRepresentation
bin110011001110110110…
…1011000000000001110
3101111222111020011112121
41212131231120000032
53300310121200420
6122313104323154
710643254264234
oct1463555300016
9344874204477
10110020100110
1142728529678
12193a56134ba
13a4b4716a6b
145479b36954
152cddc682aa
hex199db5800e

110020100110 has 16 divisors (see below), whose sum is σ = 198046940400. Its totient is φ = 44005648896.

The previous prime is 110020100089. The next prime is 110020100111. The reversal of 110020100110 is 11001020011.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110020100111) by changing a digit.

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

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

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

Almost surely, 2110020100110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 597795.

The product of its (nonzero) digits is 2, while the sum is 7.

Adding to 110020100110 its reverse (11001020011), we get a palindrome (121021120121).

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

Divisors: 1 2 5 10 19009 38018 95045 190090 578779 1157558 2893895 5787790 11002010011 22004020022 55010050055 110020100110