Search a number
-
+
110110910122 = 2293569330233
BaseRepresentation
bin110011010001100011…
…1110010011010101010
3101112012211002210110101
41212203013302122222
53301001343110442
6122330110540014
710645436202403
oct1464307623252
9345184083411
10110110910122
1142774813574
121940bb0760a
13a4ca4905b5
145487c149aa
152ce6c04cb7
hex19a31f26aa

110110910122 has 16 divisors (see below), whose sum is σ = 166021841160. Its totient is φ = 54770958592.

The previous prime is 110110910113. The next prime is 110110910123. The reversal of 110110910122 is 221019011011.

It can be written as a sum of positive squares in 4 ways, for example, as 105150384361 + 4960525761 = 324269^2 + 70431^2 .

It is a self number, because there is not a number n which added to its sum of digits gives 110110910122.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 168318 + ... + 498550.

Almost surely, 2110110910122 is an apocalyptic number.

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

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

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

The sum of its prime factors is 331097.

The product of its (nonzero) digits is 36, while the sum is 19.

Adding to 110110910122 its reverse (221019011011), we get a palindrome (331129921133).

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

Divisors: 1 2 293 569 586 1138 166717 330233 333434 660466 96758269 187902577 193516538 375805154 55055455061 110110910122