Search a number
-
+
110110020022 = 255055010011
BaseRepresentation
bin110011010001100010…
…0011001000110110110
3101112012202102120110201
41212203010121012312
53301001131120042
6122330035511114
710645425504352
oct1464304310666
9345182376421
10110110020022
1142774265852
121940b75849a
13a4ca23b402
145487a62462
152ce6acb1b7
hex19a31191b6

110110020022 has 4 divisors (see below), whose sum is σ = 165165030036. Its totient is φ = 55055010010.

The previous prime is 110110020011. The next prime is 110110020023. The reversal of 110110020022 is 220020011011.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (110110020023) 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 as a sum of consecutive naturals, namely, 27527505004 + ... + 27527505007.

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

Almost surely, 2110110020022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55055010013.

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

Adding to 110110020022 its reverse (220020011011), we get a palindrome (330130031033).

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

Divisors: 1 2 55055010011 110110020022