Search a number
-
+
110110011002 = 2197292795479
BaseRepresentation
bin110011010001100010…
…0010110111001111010
3101112012202102010002122
41212203010112321322
53301001130323002
6122330035401242
710645425436145
oct1464304267172
9345182363078
10110110011002
1142774259aa2
121940b753222
13a4ca237284
145487a5d05c
152ce6ac86a2
hex19a3116e7a

110110011002 has 16 divisors (see below), whose sum is σ = 166061871360. Its totient is φ = 54756251088.

The previous prime is 110110010921. The next prime is 110110011023. The reversal of 110110011002 is 200110011011.

It is a happy number.

110110011002 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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

It is an unprimeable number.

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, 1105499 + ... + 1200977.

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

Almost surely, 2110110011002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 98605.

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

Adding to 110110011002 its reverse (200110011011), we get a palindrome (310220022013).

Subtracting 110110011002 from its reverse (200110011011), we obtain a palindrome (90000000009).

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

Divisors: 1 2 197 394 2927 5854 95479 190958 576619 1153238 18809363 37618726 279467033 558934066 55055005501 110110011002