Search a number
-
+
10110010173 = 397118729269
BaseRepresentation
bin10010110101001101…
…01000001100111101
3222002120202201201020
421122212220030331
5131201130311143
64351112334353
7505351445214
oct113246501475
928076681636
1010110010173
11431892330a
121b619a43b9
13c51727353
146bc9dc07b
153e288d883
hex25a9a833d

10110010173 has 16 divisors (see below), whose sum is σ = 13630921920. Its totient is φ = 6664674816.

The previous prime is 10110010159. The next prime is 10110010201. The reversal of 10110010173 is 37101001101.

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

It is a de Polignac number, because none of the positive numbers 2k-10110010173 is a prime.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10110010123) 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, 330783 + ... + 360051.

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

Almost surely, 210110010173 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 30556.

The product of its (nonzero) digits is 21, while the sum is 15.

Adding to 10110010173 its reverse (37101001101), we get a palindrome (47211011274).

The spelling of 10110010173 in words is "ten billion, one hundred ten million, ten thousand, one hundred seventy-three".

Divisors: 1 3 97 291 1187 3561 29269 87807 115139 345417 2839093 8517279 34742303 104226909 3370003391 10110010173