Search a number
-
+
110053545055 = 51911071104639
BaseRepresentation
bin110011001111110110…
…0111101010001011111
3101112001211011100101021
41212133230331101133
53300342201420210
6122320301225011
710644141461326
oct1463754752137
9345054140337
10110053545055
11427453a2323
12193b4862167
13a4bb626a7c
1454803610bd
152ce1b72bda
hex199fb3d45f

110053545055 has 16 divisors (see below), whose sum is σ = 139028889600. Its totient is φ = 83400671520.

The previous prime is 110053545047. The next prime is 110053545079. The reversal of 110053545055 is 550545350011.

It is not a de Polignac number, because 110053545055 - 23 = 110053545047 is a prime.

It is a super-2 number, since 2×1100535450552 (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 110053545055.

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2110053545055 is an apocalyptic number.

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

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

110053545055 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 115734.

The product of its (nonzero) digits is 37500, while the sum is 34.

Adding to 110053545055 its reverse (550545350011), we get a palindrome (660598895066).

The spelling of 110053545055 in words is "one hundred ten billion, fifty-three million, five hundred forty-five thousand, fifty-five".

Divisors: 1 5 19 95 11071 55355 104639 210349 523195 1051745 1988141 9940705 1158458369 5792291845 22010709011 110053545055