Search a number
-
+
13201110001 is a prime number
BaseRepresentation
bin11000100101101100…
…01111001111110001
31021002000012212112001
430102312033033301
5204013441010001
610021533334001
7645064404112
oct142266171761
937060185461
1013201110001
115664756372
122685037301
131324c572c1
148d335a209
15523e2a001
hex312d8f3f1

13201110001 has 2 divisors, whose sum is σ = 13201110002. Its totient is φ = 13201110000.

The previous prime is 13201109963. The next prime is 13201110023. The reversal of 13201110001 is 10001110231.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9384959376 + 3816150625 = 96876^2 + 61775^2 .

It is a cyclic number.

It is not a de Polignac number, because 13201110001 - 215 = 13201077233 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 13201110001.

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

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

Almost surely, 213201110001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 10.

Adding to 13201110001 its reverse (10001110231), we get a palindrome (23202220232).

The spelling of 13201110001 in words is "thirteen billion, two hundred one million, one hundred ten thousand, one".