Search a number
-
+
13163104505011 is a prime number
BaseRepresentation
bin1011111110001100011000…
…1010110000110010110011
31201121101021101101212112111
42333203012022300302303
53211131014223130021
643555014032110151
72526001000124536
oct277430612606263
951541241355474
1013163104505011
11421549437147a
121587121095357
13746377169746
14337151d86a1d
1517c60895c8e1
hexbf8c62b0cb3

13163104505011 has 2 divisors, whose sum is σ = 13163104505012. Its totient is φ = 13163104505010.

The previous prime is 13163104505009. The next prime is 13163104505039. The reversal of 13163104505011 is 11050540136131.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 13163104505011 - 21 = 13163104505009 is a prime.

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

Together with 13163104505009, it forms a pair of twin primes.

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

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

Almost surely, 213163104505011 is an apocalyptic number.

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

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

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

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

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