Search a number
-
+
500506055005 = 51127732852383
BaseRepresentation
bin1110100100010000111…
…11000101000101011101
31202211220010102222012111
413102020133011011131
531200014022230010
61021532421434021
751106002162355
oct7221037050535
91684803388174
10500506055005
11183299690080
128100256b911
1338274c42bc8
141a320513b65
15d04529558a
hex74887c515d

500506055005 has 16 divisors (see below), whose sum is σ = 657573318144. Its totient is φ = 362690297280.

The previous prime is 500506054991. The next prime is 500506055059. The reversal of 500506055005 is 500550605005.

It is not a de Polignac number, because 500506055005 - 27 = 500506054877 is a prime.

It is a super-2 number, since 2×5005060550052 (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 15 ways as a sum of consecutive naturals, for example, 16410957 + ... + 16441426.

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

Almost surely, 2500506055005 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 32852676.

The product of its (nonzero) digits is 18750, while the sum is 31.

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

Divisors: 1 5 11 55 277 1385 3047 15235 32852383 164261915 361376213 1806881065 9100110091 45500550455 100101211001 500506055005