Search a number
-
+
13461363231593 is a prime number
BaseRepresentation
bin1100001111100011011111…
…0001100000101101101001
31202122220010112211001012112
43003320313301200231221
53231022332441402333
644344022003452105
72556360062354264
oct303706761405551
952586115731175
1013461363231593
11431aa28675232
121614a9b387035
1376852a2ca744
14347767b3bcdb
15185263313948
hexc3e37c60b69

13461363231593 has 2 divisors, whose sum is σ = 13461363231594. Its totient is φ = 13461363231592.

The previous prime is 13461363231571. The next prime is 13461363231601. The reversal of 13461363231593 is 39513236316431.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11875556964649 + 1585806266944 = 3446093^2 + 1259288^2 .

It is a cyclic number.

It is not a de Polignac number, because 13461363231593 - 210 = 13461363230569 is a prime.

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

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

Almost surely, 213461363231593 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3149280, while the sum is 50.

The spelling of 13461363231593 in words is "thirteen trillion, four hundred sixty-one billion, three hundred sixty-three million, two hundred thirty-one thousand, five hundred ninety-three".