Search a number
-
+
51225314050553 is a prime number
BaseRepresentation
bin10111010010110110100101…
…01001011100000111111001
320201101002111012201101022012
423221123102221130013321
523203233420344104203
6300540330121535305
713534623015124616
oct1351332251340771
9221332435641265
1051225314050553
111535a596382015
1258b3986044535
1322776ac621406
14c91465aa950d
155dc74bda4bd8
hex2e96d2a5c1f9

51225314050553 has 2 divisors, whose sum is σ = 51225314050554. Its totient is φ = 51225314050552.

The previous prime is 51225314050487. The next prime is 51225314050571. The reversal of 51225314050553 is 35505041352215.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 43747998807529 + 7477315243024 = 6614227^2 + 2734468^2 .

It is a cyclic number.

It is not a de Polignac number, because 51225314050553 - 230 = 51224240308729 is a prime.

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

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

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

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

Almost surely, 251225314050553 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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