Search a number
-
+
50512521514093 is a prime number
BaseRepresentation
bin10110111110000110111001…
…11001101100110001101101
320121211221122110210210120121
423133003130321230301231
523110044121001422333
6255233044304044541
713432260241414462
oct1337033471546155
9217757573723517
1050512521514093
1115105270599441
1257b97b9303751
132225405a80c92
14c68b67801669
155c8e2ebcb32d
hex2df0dce6cc6d

50512521514093 has 2 divisors, whose sum is σ = 50512521514094. Its totient is φ = 50512521514092.

The previous prime is 50512521514009. The next prime is 50512521514141. The reversal of 50512521514093 is 39041512521505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 50227085629449 + 285435884644 = 7087107^2 + 534262^2 .

It is a cyclic number.

It is not a de Polignac number, because 50512521514093 - 229 = 50511984643181 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 250512521514093 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 270000, while the sum is 43.

The spelling of 50512521514093 in words is "fifty trillion, five hundred twelve billion, five hundred twenty-one million, five hundred fourteen thousand, ninety-three".