Search a number
-
+
13469131513 is a prime number
BaseRepresentation
bin11001000101101001…
…01010001011111001
31021202200112202220201
430202310222023321
5210041044202023
610104310122201
7654530504665
oct144264521371
937680482821
1013469131513
115791a78952
12273a950361
131368639706
1491aba78a5
1553c71dbad
hex322d2a2f9

13469131513 has 2 divisors, whose sum is σ = 13469131514. Its totient is φ = 13469131512.

The previous prime is 13469131493. The next prime is 13469131517. The reversal of 13469131513 is 31513196431.

13469131513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10458743824 + 3010387689 = 102268^2 + 54867^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 13469131513 - 29 = 13469131001 is a prime.

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

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

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

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

Almost surely, 213469131513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 29160, while the sum is 37.

The spelling of 13469131513 in words is "thirteen billion, four hundred sixty-nine million, one hundred thirty-one thousand, five hundred thirteen".