Search a number
-
+
51520070993 is a prime number
BaseRepresentation
bin101111111110110101…
…011110010101010001
311220222112002210000112
4233332311132111101
51321003114232433
635400141531105
73502500243416
oct577665362521
9156875083015
1051520070993
111a938811976
129b99b73a95
134b2096b811
1426ca57a10d
151518056348
hexbfed5e551

51520070993 has 2 divisors, whose sum is σ = 51520070994. Its totient is φ = 51520070992.

The previous prime is 51520070957. The next prime is 51520070999. The reversal of 51520070993 is 39907002515.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 50996027329 + 524043664 = 225823^2 + 22892^2 .

It is a cyclic number.

It is not a de Polignac number, because 51520070993 - 210 = 51520069969 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is not a weakly prime, because it can be changed into another prime (51520070999) 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, 25760035496 + 25760035497.

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

Almost surely, 251520070993 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 85050, while the sum is 41.

The spelling of 51520070993 in words is "fifty-one billion, five hundred twenty million, seventy thousand, nine hundred ninety-three".