Search a number
-
+
110220112002 = 2371113374761173
BaseRepresentation
bin110011010100110100…
…0010111000010000010
3101112111102120211021110
41212221220113002002
53301212322041002
6122345011304150
710651233331260
oct1465150270202
9345442524243
10110220112002
114282041a560
12194405ab056
13a516ca65b0
14549851d430
152d015c5e6c
hex19a9a17082

110220112002 has 512 divisors, whose sum is σ = 317355687936. Its totient is φ = 24609484800.

The previous prime is 110220112001. The next prime is 110220112021. The reversal of 110220112002 is 200211022011.

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

It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 637110388 + ... + 637110560.

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

Almost surely, 2110220112002 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 110220112002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158677843968).

110220112002 is an abundant number, since it is smaller than the sum of its proper divisors (207135575934).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 354.

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

Adding to 110220112002 its reverse (200211022011), we get a palindrome (310431134013).

It can be divided in two parts, 11022011 and 2002, that multiplied together give a palindrome (22066066022).

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