Search a number
-
+
53755621752061 is a prime number
BaseRepresentation
bin11000011100011111101001…
…01111010011110011111101
321001022222122201001201000001
430032033310233103303331
524021213003132031221
6310154554113234301
714215500263535205
oct1416176457236375
9231288581051001
1053755621752061
11161456a4088a99
126042248b62991
1323cc197061a28
14d3bb00a03405
15633491620391
hex30e3f4bd3cfd

53755621752061 has 2 divisors, whose sum is σ = 53755621752062. Its totient is φ = 53755621752060.

The previous prime is 53755621752029. The next prime is 53755621752083. The reversal of 53755621752061 is 16025712655735.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 50269163505625 + 3486458246436 = 7090075^2 + 1867206^2 .

It is a cyclic number.

It is not a de Polignac number, because 53755621752061 - 25 = 53755621752029 is a prime.

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

It is a congruent number.

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

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

Almost surely, 253755621752061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13230000, while the sum is 55.

The spelling of 53755621752061 in words is "fifty-three trillion, seven hundred fifty-five billion, six hundred twenty-one million, seven hundred fifty-two thousand, sixty-one".