Search a number
-
+
2001102001 is a prime number
BaseRepresentation
bin111011101000110…
…0110010010110001
312011110102111212221
41313101212102301
513044240231001
6530322321041
7100406041423
oct16721462261
95143374787
102001102001
1193762a608
1247a1b9181
1325b771b32
1414daa4813
15baa2e1a1
hex774664b1

2001102001 has 2 divisors, whose sum is σ = 2001102002. Its totient is φ = 2001102000.

The previous prime is 2001101989. The next prime is 2001102007. The reversal of 2001102001 is 1002011002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1207215025 + 793886976 = 34745^2 + 28176^2 .

It is a cyclic number.

It is not a de Polignac number, because 2001102001 - 215 = 2001069233 is a prime.

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

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

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

Almost surely, 22001102001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4, while the sum is 7.

The square root of 2001102001 is about 44733.6785990153. The cubic root of 2001102001 is about 1260.1524131158.

Adding to 2001102001 its reverse (1002011002), we get a palindrome (3003113003).

Subtracting from 2001102001 its reverse (1002011002), we obtain a palindrome (999090999).

The spelling of 2001102001 in words is "two billion, one million, one hundred two thousand, one".