Search a number
-
+
110050106013 = 3243284367199
BaseRepresentation
bin110011001111101111…
…1110101101010011101
3101112001120200121220100
41212133133311222131
53300340311343023
6122320055411313
710644100316061
oct1463737655235
9345046617810
10110050106013
1142743463541
12193b3683b39
13a4ba9c1633
14547db07aa1
152ce16e3c43
hex199f7f5a9d

110050106013 has 12 divisors (see below), whose sum is σ = 162658038400. Its totient is φ = 71660533896.

The previous prime is 110050106011. The next prime is 110050106021. The reversal of 110050106013 is 310601050011.

110050106013 is a `hidden beast` number, since 1 + 1 + 0 + 0 + 50 + 10 + 601 + 3 = 666.

It is not a de Polignac number, because 110050106013 - 21 = 110050106011 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

Almost surely, 2110050106013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 90, while the sum is 18.

Adding to 110050106013 its reverse (310601050011), we get a palindrome (420651156024).

The spelling of 110050106013 in words is "one hundred ten billion, fifty million, one hundred six thousand, thirteen".

Divisors: 1 3 9 43 129 387 284367199 853101597 2559304791 12227789557 36683368671 110050106013