Search a number
-
+
110131102203133 = 1123916323240671
BaseRepresentation
bin11001000010100111100101…
…001110011011110011111101
3112102221102121212110202012011
4121002213211032123303331
5103413341444131000013
61030121310243011221
732124465244044244
oct3102474516336375
9472842555422164
10110131102203133
113210037a099900
121042818b369b11
13495b41a61869b
141d2a53395d95b
15caeb691e4c3d
hex6429e539bcfd

110131102203133 has 12 divisors (see below), whose sum is σ = 121056291201664. Its totient is φ = 100116623039400.

The previous prime is 110131102203119. The next prime is 110131102203179. The reversal of 110131102203133 is 331302201131011.

It is not a de Polignac number, because 110131102203133 - 213 = 110131102194941 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6881613 + ... + 16359058.

Almost surely, 2110131102203133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 23279856 (or 23279845 counting only the distinct ones).

The product of its (nonzero) digits is 324, while the sum is 22.

Adding to 110131102203133 its reverse (331302201131011), we get a palindrome (441433303334144).

The spelling of 110131102203133 in words is "one hundred ten trillion, one hundred thirty-one billion, one hundred two million, two hundred three thousand, one hundred thirty-three".

Divisors: 1 11 121 39163 430793 4738723 23240671 255647381 2812121191 910174398373 10011918382103 110131102203133