Search a number
-
+
53034622015213 is a prime number
BaseRepresentation
bin11000000111100000101011…
…10011100101011011101101
320221210001121222212010212201
430003300111303211123231
523422404401213441323
6304443434034501501
714112424242101116
oct1403602563453355
9227701558763781
1053034622015213
1115997947577283
125b4656b734891
1323791b30729c7
14d14c6473720d
1561e843b6d8ad
hex303c15ce56ed

53034622015213 has 2 divisors, whose sum is σ = 53034622015214. Its totient is φ = 53034622015212.

The previous prime is 53034622015169. The next prime is 53034622015237. The reversal of 53034622015213 is 31251022643035.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 31382370388009 + 21652251627204 = 5601997^2 + 4653198^2 .

It is a cyclic number.

It is not a de Polignac number, because 53034622015213 - 221 = 53034619918061 is a prime.

It is a super-2 number, since 2×530346220152132 (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 (53034622015273) by changing a digit.

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

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

Almost surely, 253034622015213 is an apocalyptic number.

It is an amenable number.

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

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

53034622015213 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 129600, while the sum is 37.

Adding to 53034622015213 its reverse (31251022643035), we get a palindrome (84285644658248).

The spelling of 53034622015213 in words is "fifty-three trillion, thirty-four billion, six hundred twenty-two million, fifteen thousand, two hundred thirteen".