Search a number
-
+
500506005 = 353110110657
BaseRepresentation
bin11101110101010…
…001110110010101
31021212210100011110
4131311101312111
52011112143010
6121355325233
715255142116
oct3565216625
91255710143
10500506005
1123758262a
1211b750819
137c9014cc
144a68820d
152de18120
hex1dd51d95

500506005 has 32 divisors (see below), whose sum is σ = 834905088. Its totient is φ = 255744000.

The previous prime is 500506003. The next prime is 500506009. The reversal of 500506005 is 500605005.

It is not a de Polignac number, because 500506005 - 21 = 500506003 is a prime.

It is a super-2 number, since 2×5005060052 = 501012522082120050, which contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (500506003) by changing a digit.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41637 + ... + 52293.

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

Almost surely, 2500506005 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10797.

The product of its (nonzero) digits is 750, while the sum is 21.

The square root of 500506005 is about 22371.9915295890. The cubic root of 500506005 is about 793.9681800046.

The spelling of 500506005 in words is "five hundred million, five hundred six thousand, five".

Divisors: 1 3 5 15 31 93 101 155 303 465 505 1515 3131 9393 10657 15655 31971 46965 53285 159855 330367 991101 1076357 1651835 3229071 4955505 5381785 16145355 33367067 100101201 166835335 500506005