Search a number
-
+
110210110011 = 3215777997247
BaseRepresentation
bin110011010100100001…
…0001101001000111011
3101112110201202200010100
41212221002031020323
53301202242010021
6122344013050443
710651052323041
oct1465102151073
9345421680110
10110210110011
1142815808951
1219439186a23
13a514bb3b61
145497078391
152d0079c626
hex19a908d23b

110210110011 has 12 divisors (see below), whose sum is σ = 160206347392. Its totient is φ = 73005422256.

The previous prime is 110210109991. The next prime is 110210110019. The reversal of 110210110011 is 110011012011.

It is not a de Polignac number, because 110210110011 - 234 = 93030240827 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (110210110019) 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 11 ways as a sum of consecutive naturals, for example, 38997211 + ... + 39000036.

Almost surely, 2110210110011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 77997410 (or 77997407 counting only the distinct ones).

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

Adding to 110210110011 its reverse (110011012011), we get a palindrome (220221122022).

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

Divisors: 1 3 9 157 471 1413 77997247 233991741 701975223 12245567779 36736703337 110210110011