Search a number
-
+
110050106014 = 2239461252869
BaseRepresentation
bin110011001111101111…
…1110101101010011110
3101112001120200121220101
41212133133311222132
53300340311343024
6122320055411314
710644100316062
oct1463737655236
9345046617811
10110050106014
1142743463542
12193b3683b3a
13a4ba9c1634
14547db07aa2
152ce16e3c44
hex199f7f5a9e

110050106014 has 16 divisors (see below), whose sum is σ = 172271227680. Its totient is φ = 52626888160.

The previous prime is 110050106011. The next prime is 110050106021. The reversal of 110050106014 is 410601050011.

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

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

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 7 ways as a sum of consecutive naturals, for example, 308772 + ... + 561640.

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

Almost surely, 2110050106014 is an apocalyptic number.

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

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

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

The sum of its prime factors is 262355.

The product of its (nonzero) digits is 120, while the sum is 19.

Adding to 110050106014 its reverse (410601050011), we get a palindrome (520651156025).

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

Divisors: 1 2 23 46 9461 18922 217603 252869 435206 505738 5815987 11631974 2392393609 4784787218 55025053007 110050106014