Search a number
-
+
201102012002161 is a prime number
BaseRepresentation
bin101101101110011010110101…
…111111010010111101110001
3222101001011102222122010101201
4231232122311333102331301
5202324323410033032121
61551412553335131201
760234066220632544
oct5556326577227561
9871034388563351
10201102012002161
1159093980069346
121a67ab00b13b01
138829ab8b5447a
1437935643cc85b
15183b1d14c3e91
hexb6e6b5fd2f71

201102012002161 has 2 divisors, whose sum is σ = 201102012002162. Its totient is φ = 201102012002160.

The previous prime is 201102012002153. The next prime is 201102012002189. The reversal of 201102012002161 is 161200210201102.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 159375980336400 + 41726031665761 = 12624420^2 + 6459569^2 .

It is a cyclic number.

It is not a de Polignac number, because 201102012002161 - 23 = 201102012002153 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

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

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

Almost surely, 2201102012002161 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 201102012002161 its reverse (161200210201102), we get a palindrome (362302222203263).

The spelling of 201102012002161 in words is "two hundred one trillion, one hundred two billion, twelve million, two thousand, one hundred sixty-one".