Search a number
-
+
250610055050051 is a prime number
BaseRepresentation
bin111000111110110110110011…
…010011101111001101000011
31012212100002100121222211210122
4320332312303103233031003
5230321443343043100201
62245000400411450455
7103533656534305454
oct7076666323571503
91185302317884718
10250610055050051
1172941144759954
1224135aa8456a2b
13a9ab5718626c8
1445c583ca8512b
151de8e216a0e1b
hexe3edb34ef343

250610055050051 has 2 divisors, whose sum is σ = 250610055050052. Its totient is φ = 250610055050050.

The previous prime is 250610055050021. The next prime is 250610055050059. The reversal of 250610055050051 is 150050550016052.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 250610055050051 - 218 = 250610054787907 is a prime.

It is a Sophie Germain prime.

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

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

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

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

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

Almost surely, 2250610055050051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 37500, while the sum is 35.

The spelling of 250610055050051 in words is "two hundred fifty trillion, six hundred ten billion, fifty-five million, fifty thousand, fifty-one".