Search a number
-
+
110053505055 = 3513599565711
BaseRepresentation
bin110011001111110110…
…0110011100000011111
3101112001211002022111210
41212133230303200133
53300342144130210
6122320300315503
710644141233604
oct1463754634037
9345054068453
10110053505055
114274537526a
12193b4842b93
13a4bb6117c0
1454803506ab
152ce1b65e20
hex199fb3381f

110053505055 has 32 divisors (see below), whose sum is σ = 192844753920. Its totient is φ = 53261873280.

The previous prime is 110053504987. The next prime is 110053505083. The reversal of 110053505055 is 550505350011.

It is a de Polignac number, because none of the positive numbers 2k-110053505055 is a prime.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4771351 + ... + 4794360.

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

Almost surely, 2110053505055 is an apocalyptic number.

110053505055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

The sum of its prime factors is 9565791.

The product of its (nonzero) digits is 9375, while the sum is 30.

Adding to 110053505055 its reverse (550505350011), we get a palindrome (660558855066).

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

Divisors: 1 3 5 13 15 39 59 65 177 195 295 767 885 2301 3835 11505 9565711 28697133 47828555 124354243 143485665 373062729 564376949 621771215 1693130847 1865313645 2821884745 7336900337 8465654235 22010701011 36684501685 110053505055