Search a number
-
+
110000011010146 = 2179307262600587
BaseRepresentation
bin11001000000101101011111…
…100101001110000001100010
3112102110220020220021011012021
4121000231133211032001202
5103404220010304311041
61025541150223452054
732112144550224235
oct3100553745160142
9472426226234167
10110000011010146
113205a819580294
12104068a515702a
13494bc58657a3a
141d240595a941c
15cab545689cd1
hex640b5f94e062

110000011010146 has 8 divisors (see below), whose sum is σ = 165921804317520. Its totient is φ = 54692742904308.

The previous prime is 110000011010137. The next prime is 110000011010147. The reversal of 110000011010146 is 641010110000011.

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

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 153631299936 + ... + 153631300651.

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

Almost surely, 2110000011010146 is an apocalyptic number.

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

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

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

The sum of its prime factors is 307262600768.

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

Adding to 110000011010146 its reverse (641010110000011), we get a palindrome (751010121010157).

The spelling of 110000011010146 in words is "one hundred ten trillion, eleven million, ten thousand, one hundred forty-six".

Divisors: 1 2 179 358 307262600587 614525201174 55000005505073 110000011010146