Search a number
-
+
15397153247863 is a prime number
BaseRepresentation
bin1110000000001110110111…
…0110011001001001110111
32000111221202002020202110001
43200003231312121021313
54004231332212412423
652425204330012131
73146256545122522
oct340035566311167
960457662222401
1015397153247863
1149a6994672962
1218880a3577047
13878c39b418aa
143b3324963bb9
151ba7ae18acad
hexe00edd99277

15397153247863 has 2 divisors, whose sum is σ = 15397153247864. Its totient is φ = 15397153247862.

The previous prime is 15397153247849. The next prime is 15397153247869. The reversal of 15397153247863 is 36874235179351.

It is a strong prime.

It is an emirp because it is prime and its reverse (36874235179351) is a distict prime.

It is a cyclic number.

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

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 215397153247863 is an apocalyptic number.

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

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

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

The product of its digits is 114307200, while the sum is 64.

The spelling of 15397153247863 in words is "fifteen trillion, three hundred ninety-seven billion, one hundred fifty-three million, two hundred forty-seven thousand, eight hundred sixty-three".