Search a number
-
+
53011115979469 is a prime number
BaseRepresentation
bin11000000110110100111001…
…01111001011001011001101
320221200210221211002210202021
430003122130233023023031
523422013231142320334
6304424545342530141
714110632605065504
oct1403323457131315
9227623854083667
1053011115979469
1115988984a7875a
125b41aab596951
132376c081c740b
14d13a7496183b
1561de1a2023b4
hex30369cbcb2cd

53011115979469 has 2 divisors, whose sum is σ = 53011115979470. Its totient is φ = 53011115979468.

The previous prime is 53011115979431. The next prime is 53011115979491. The reversal of 53011115979469 is 96497951111035.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 38945150766025 + 14065965213444 = 6240605^2 + 3750462^2 .

It is a cyclic number.

It is not a de Polignac number, because 53011115979469 - 233 = 53002526044877 is a prime.

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

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

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

Almost surely, 253011115979469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9185400, while the sum is 61.

The spelling of 53011115979469 in words is "fifty-three trillion, eleven billion, one hundred fifteen million, nine hundred seventy-nine thousand, four hundred sixty-nine".