Search a number
-
+
50053513325351 is a prime number
BaseRepresentation
bin10110110000101111111011…
…11000011010101100100111
320120020001212101220212002212
423120113331320122230213
523030034043402402401
6254242133325354035
713354150502242664
oct1330277570325447
9216201771825085
1050053513325351
1114a4863741a508
12574485840891b
1321c1045316633
14c508627a4a6b
155bc017b94dbb
hex2d85fde1ab27

50053513325351 has 2 divisors, whose sum is σ = 50053513325352. Its totient is φ = 50053513325350.

The previous prime is 50053513325329. The next prime is 50053513325399. The reversal of 50053513325351 is 15352331535005.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 50053513325351 - 230 = 50052439583527 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 250053513325351 is an apocalyptic number.

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

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

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

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

The spelling of 50053513325351 in words is "fifty trillion, fifty-three billion, five hundred thirteen million, three hundred twenty-five thousand, three hundred fifty-one".