Search a number
-
+
5550505555055 = 51110101111011
BaseRepresentation
bin101000011000101001111…
…1010010111010001101111
3201122121211021102212102212
41100301103322113101233
51211414413410230210
615445511141041035
71112003462525636
oct120612372272157
921577737385385
105550505555055
11184aa57758aaa
127578850b617b
13313544930456
141529084da51d
15995ac2ad805
hex50c53e9746f

5550505555055 has 4 divisors (see below), whose sum is σ = 6660606666072. Its totient is φ = 4440404444040.

The previous prime is 5550505554991. The next prime is 5550505555097. The reversal of 5550505555055 is 5505555050555.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 5550505555055 - 26 = 5550505554991 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 25550505555055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1110101111016.

The product of its (nonzero) digits is 9765625, while the sum is 50.

The spelling of 5550505555055 in words is "five trillion, five hundred fifty billion, five hundred five million, five hundred fifty-five thousand, fifty-five".

Divisors: 1 5 1110101111011 5550505555055