Search a number
-
+
502602326141 is a prime number
BaseRepresentation
bin1110101000001010110…
…11101110000001111101
31210001022012221120121012
413110011123232001331
531213312143414031
61022520424045005
751211645166126
oct7240533560175
91701265846535
10502602326141
11184174a01663
12814a8603765
133851a326726
141a47caad04d
15d119322b2b
hex75056ee07d

502602326141 has 2 divisors, whose sum is σ = 502602326142. Its totient is φ = 502602326140.

The previous prime is 502602326101. The next prime is 502602326143. The reversal of 502602326141 is 141623206205.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 430749379225 + 71852946916 = 656315^2 + 268054^2 .

It is a cyclic number.

It is not a de Polignac number, because 502602326141 - 26 = 502602326077 is a prime.

Together with 502602326143, it forms a pair of twin primes.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 502602326098 and 502602326107.

It is a congruent number.

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

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

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

Almost surely, 2502602326141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17280, while the sum is 32.

The spelling of 502602326141 in words is "five hundred two billion, six hundred two million, three hundred twenty-six thousand, one hundred forty-one".