Search a number
-
+
5005505050555 = 51001101010111
BaseRepresentation
bin100100011010110111101…
…0110011011011110111011
3122201112002020211200002111
41020311233112123132323
51124002233243104210
614351255224513151
71024431036630202
oct110655726333673
918645066750074
105005505050555
11165a906120519
1268a12561b7b7
132a402b755a29
141343a6956239
158a310b8c88a
hex48d6f59b7bb

5005505050555 has 4 divisors (see below), whose sum is σ = 6006606060672. Its totient is φ = 4004404040440.

The previous prime is 5005505050549. The next prime is 5005505050583. The reversal of 5005505050555 is 5550505055005.

5005505050555 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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

It is not a de Polignac number, because 5005505050555 - 241 = 2806481795003 is a prime.

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

It is a Duffinian number.

It is an unprimeable number.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500550505051 + ... + 500550505060.

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

Almost surely, 25005505050555 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1001101010116.

The product of its (nonzero) digits is 390625, while the sum is 40.

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

Divisors: 1 5 1001101010111 5005505050555