Search a number
-
+
201002211111017 is a prime number
BaseRepresentation
bin101101101100111101111001…
…011001000111000001101001
3222100200121211200122120011002
4231230331321121013001221
5202321210012021023032
61551255050243444345
760223634112230411
oct5554757131070151
9870617750576132
10201002211111017
1159055617067718
121a6636a99866b5
138820572679524
14378c7b799b641
1518387de9b9862
hexb6cf79647069

201002211111017 has 2 divisors, whose sum is σ = 201002211111018. Its totient is φ = 201002211111016.

The previous prime is 201002211111011. The next prime is 201002211111131. The reversal of 201002211111017 is 710111112200102.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 131352320497216 + 69649890613801 = 11460904^2 + 8345651^2 .

It is a cyclic number.

It is not a de Polignac number, because 201002211111017 - 240 = 199902699483241 is a prime.

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

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

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

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

Almost surely, 2201002211111017 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 56, while the sum is 20.

Adding to 201002211111017 its reverse (710111112200102), we get a palindrome (911113323311119).

The spelling of 201002211111017 in words is "two hundred one trillion, two billion, two hundred eleven million, one hundred eleven thousand, seventeen".