Search a number
-
+
1106055600141 = 31997200046229
BaseRepresentation
bin10000000110000110000…
…011010001100000001101
310220201220220202010110110
4100012012003101200031
5121110200213201031
62204040454030233
7142624042323312
oct20060603214015
93821826663413
101106055600141
11397091608008
1215a43b948379
13803ba54041b
143b76782ad09
151db8741cc46
hex101860d180d

1106055600141 has 16 divisors (see below), whose sum is σ = 1568362443200. Its totient is φ = 691359763968.

The previous prime is 1106055600131. The next prime is 1106055600173. The reversal of 1106055600141 is 1410065506011.

It is not a de Polignac number, because 1106055600141 - 26 = 1106055600077 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 1106055600099 and 1106055600108.

It is a congruent number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 100017586 + ... + 100028643.

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

Almost surely, 21106055600141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 200046348.

The product of its (nonzero) digits is 3600, while the sum is 30.

The spelling of 1106055600141 in words is "one trillion, one hundred six billion, fifty-five million, six hundred thousand, one hundred forty-one".

Divisors: 1 3 19 57 97 291 1843 5529 200046229 600138687 3800878351 11402635053 19404484213 58213452639 368685200047 1106055600141