Search a number
-
+
110110022001 = 337582592709
BaseRepresentation
bin110011010001100010…
…0011001100101110001
3101112012202102200012000
41212203010121211301
53301001131201001
6122330035524213
710645425513210
oct1464304314561
9345182380160
10110110022001
1142774267291
121940b759669
13a4ca23c295
145487a63077
152ce6acba86
hex19a3119971

110110022001 has 16 divisors (see below), whose sum is σ = 186429667200. Its totient is φ = 62920012464.

The previous prime is 110110021939. The next prime is 110110022081. The reversal of 110110022001 is 100220011011.

It is a happy number.

It is not a de Polignac number, because 110110022001 - 231 = 107962538353 is a prime.

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

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

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

Almost surely, 2110110022001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 110110022001 its reverse (100220011011), we get a palindrome (210330033012).

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

Divisors: 1 3 7 9 21 27 63 189 582592709 1747778127 4078148963 5243334381 12234446889 15730003143 36703340667 110110022001