Search a number
-
+
500762115137 is a prime number
BaseRepresentation
bin1110100100101111011…
…11110111110001000001
31202212112222021011200002
413102113233313301001
531201030100141022
61022014050005345
751115231514354
oct7222757676101
91685488234602
10500762115137
11183410182919
1281074276855
13382b5cc7a8b
141a34652a29b
15d05c9c5092
hex7497bf7c41

500762115137 has 2 divisors, whose sum is σ = 500762115138. Its totient is φ = 500762115136.

The previous prime is 500762115131. The next prime is 500762115149. The reversal of 500762115137 is 731511267005.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 500755784881 + 6330256 = 707641^2 + 2516^2 .

It is a cyclic number.

It is not a de Polignac number, because 500762115137 - 24 = 500762115121 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 500762115137.

It is not a weakly prime, because it can be changed into another prime (500762115131) by changing a digit.

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 as a sum of consecutive naturals, namely, 250381057568 + 250381057569.

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

Almost surely, 2500762115137 is an apocalyptic number.

It is an amenable number.

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

500762115137 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 44100, while the sum is 38.

The spelling of 500762115137 in words is "five hundred billion, seven hundred sixty-two million, one hundred fifteen thousand, one hundred thirty-seven".