Search a number
-
+
13117465369 is a prime number
BaseRepresentation
bin11000011011101110…
…01010001100011001
31020212011211021122201
430031313022030121
5203331032342434
610005344450201
7643030421161
oct141567121431
936764737581
1013117465369
115621515978
122661019961
13131081c038
148c61c55a1
1551b906614
hex30ddca319

13117465369 has 2 divisors, whose sum is σ = 13117465370. Its totient is φ = 13117465368.

The previous prime is 13117465351. The next prime is 13117465379. The reversal of 13117465369 is 96356471131.

13117465369 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., 7801305625 + 5316159744 = 88325^2 + 72912^2 .

It is a cyclic number.

It is not a de Polignac number, because 13117465369 - 225 = 13083910937 is a prime.

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

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

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

Almost surely, 213117465369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 408240, while the sum is 46.

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