Search a number
-
+
110055010615 = 5114394558087
BaseRepresentation
bin110011001111111001…
…0100011000100110111
3101112001220220210202021
41212133302203010313
53300343040314430
6122320352454011
710644160104154
oct1463762430467
9345056823667
10110055010615
1142746203430
12193b524a307
13a4bba1ab74
14548062322b
152ce1d6207a
hex199fca3137

110055010615 has 16 divisors (see below), whose sum is σ = 144400227840. Its totient is φ = 79857666720.

The previous prime is 110055010613. The next prime is 110055010631. The reversal of 110055010615 is 516010550011.

It is not a de Polignac number, because 110055010615 - 21 = 110055010613 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 110055010615.

It is a congruent number.

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

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

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

Almost surely, 2110055010615 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4558542.

The product of its (nonzero) digits is 750, while the sum is 25.

Adding to 110055010615 its reverse (516010550011), we get a palindrome (626065560626).

The spelling of 110055010615 in words is "one hundred ten billion, fifty-five million, ten thousand, six hundred fifteen".

Divisors: 1 5 11 55 439 2195 4829 24145 4558087 22790435 50138957 250694785 2001000193 10005000965 22011002123 110055010615