Search a number
-
+
15396951971053 is a prime number
BaseRepresentation
bin1110000000001110000111…
…0110100101010011101101
32000111221020001111211120101
43200003201312211103231
54004230424201033203
652425132335551101
73146251552236622
oct340034166452355
960457201454511
1015396951971053
1149a68a0a98694
12188804808b491
13878c0722b3a3
143b3305d2c349
151ba79b67d41d
hexe00e1da54ed

15396951971053 has 2 divisors, whose sum is σ = 15396951971054. Its totient is φ = 15396951971052.

The previous prime is 15396951970999. The next prime is 15396951971081. The reversal of 15396951971053 is 35017915969351.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10757330746569 + 4639621224484 = 3279837^2 + 2153978^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-15396951971053 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 215396951971053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 34445250, while the sum is 64.

The spelling of 15396951971053 in words is "fifteen trillion, three hundred ninety-six billion, nine hundred fifty-one million, nine hundred seventy-one thousand, fifty-three".