Search a number
-
+
2001102913 is a prime number
BaseRepresentation
bin111011101000110…
…0110100001000001
312011110102120010201
41313101212201001
513044240243123
6530322325201
7100406044165
oct16721464101
95143376121
102001102913
11937630267
1247a1b9801
1325b772384
1414daa4ca5
15baa2e5ad
hex77466841

2001102913 has 2 divisors, whose sum is σ = 2001102914. Its totient is φ = 2001102912.

The previous prime is 2001102907. The next prime is 2001103007. The reversal of 2001102913 is 3192011002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1698099264 + 303003649 = 41208^2 + 17407^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-2001102913 is a prime.

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

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

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

Almost surely, 22001102913 is an apocalyptic number.

It is an amenable number.

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

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

2001102913 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 108, while the sum is 19.

The square root of 2001102913 is about 44733.6887926762. The cubic root of 2001102913 is about 1260.1526045535.

Adding to 2001102913 its reverse (3192011002), we get a palindrome (5193113915).

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