Search a number
-
+
500550505055 = 5100110101011
BaseRepresentation
bin1110100100010110010…
…00101001001001011111
31202212000020002021012122
413102023020221021133
531200111412130210
61021541050253155
751110052043346
oct7221310511137
91685006067178
10500550505055
11183311790057
12810154271bb
1338281207103
141a3263a4b5d
15d049125b55
hex748b22925f

500550505055 has 4 divisors (see below), whose sum is σ = 600660606072. Its totient is φ = 400440404040.

The previous prime is 500550505033. The next prime is 500550505061. The reversal of 500550505055 is 550505055005.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 550505055005 = 5110101011001.

It is not a de Polignac number, because 500550505055 - 222 = 500546310751 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2500550505055 is an apocalyptic number.

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

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

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

The sum of its prime factors is 100110101016.

The product of its (nonzero) digits is 78125, while the sum is 35.

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

Divisors: 1 5 100110101011 500550505055