Search a number
-
+
11164531513 is a prime number
BaseRepresentation
bin10100110010111010…
…10011101100111001
31001211002000222001011
422121131103230321
5140331110002023
65043502353521
7543444644362
oct123135235471
931732028034
1011164531513
11480a0a5853
1221b6b8b8a1
13108c043885
1477ca9cb69
1545523e50d
hex299753b39

11164531513 has 2 divisors, whose sum is σ = 11164531514. Its totient is φ = 11164531512.

The previous prime is 11164531507. The next prime is 11164531531. The reversal of 11164531513 is 31513546111.

Together with next prime (11164531531) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9952656169 + 1211875344 = 99763^2 + 34812^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 11164531513 - 217 = 11164400441 is a prime.

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

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

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

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

Almost surely, 211164531513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 5400, while the sum is 31.

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