Search a number
-
+
110055345555 = 3551133143489
BaseRepresentation
bin110011001111111001…
…1110100110110010011
3101112001221112211012110
41212133303310312103
53300343132024210
6122320404000403
710644163000521
oct1463763646623
9345057484173
10110055345555
1142746412041
12193b5390103
13a4bbb0745c
1454806ad311
152ce1dcb420
hex199fcf4d93

110055345555 has 16 divisors (see below), whose sum is σ = 176093223840. Its totient is φ = 58694627328.

The previous prime is 110055345511. The next prime is 110055345581. The reversal of 110055345555 is 555543550011.

It is not a de Polignac number, because 110055345555 - 222 = 110051151251 is a prime.

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2110055345555 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 194630.

The product of its (nonzero) digits is 187500, while the sum is 39.

Adding to 110055345555 its reverse (555543550011), we get a palindrome (665598895566).

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

Divisors: 1 3 5 15 51133 143489 153399 255665 430467 717445 766995 2152335 7337023037 22011069111 36685115185 110055345555