Search a number
-
+
500612531479397 is a prime number
BaseRepresentation
bin111000111010011011111000…
…0000110111110001101100101
32102122112002110001121210221022
41301310313300012332031211
51011104013431024320042
64532414115545100525
7210306030132553151
oct16164676006761545
92378462401553838
10500612531479397
11135568645095307
124819208ba87745
131864473661025c
148b89ac0b4a061
153cd21329c1cd2
hex1c74df01be365

500612531479397 has 2 divisors, whose sum is σ = 500612531479398. Its totient is φ = 500612531479396.

The previous prime is 500612531479391. The next prime is 500612531479433. The reversal of 500612531479397 is 793974135216005.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 296312362803076 + 204300168676321 = 17213726^2 + 14293361^2 .

It is a cyclic number.

It is not a de Polignac number, because 500612531479397 - 210 = 500612531478373 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 250306265739698 + 250306265739699.

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

Almost surely, 2500612531479397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 42865200, while the sum is 62.

The spelling of 500612531479397 in words is "five hundred trillion, six hundred twelve billion, five hundred thirty-one million, four hundred seventy-nine thousand, three hundred ninety-seven".