Search a number
-
+
110210211022 = 255105105511
BaseRepresentation
bin110011010100100001…
…0100101110011001110
3101112110201221210200111
41212221002211303032
53301202303223042
6122344015150234
710651053223402
oct1465102456316
9345421853614
10110210211022
114281587782a
121943921537a
13a514c1ab22
1454970a3102
152d007bc517
hex19a90a5cce

110210211022 has 4 divisors (see below), whose sum is σ = 165315316536. Its totient is φ = 55105105510.

The previous prime is 110210210951. The next prime is 110210211043. The reversal of 110210211022 is 220112012011.

It is a semiprime because it is the product of two primes.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27552552754 + ... + 27552552757.

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

Almost surely, 2110210211022 is an apocalyptic number.

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

110210211022 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 55105105513.

The product of its (nonzero) digits is 16, while the sum is 13.

Adding to 110210211022 its reverse (220112012011), we get a palindrome (330322223033).

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

Divisors: 1 2 55105105511 110210211022