Search a number
-
+
201101100022001 is a prime number
BaseRepresentation
bin101101101110011001111111…
…101000010111100011110001
3222101001002002102120201210202
4231232121333220113203301
5202324320023101201001
61551412323040204545
760234034505136344
oct5556317750274361
9871032072521722
10201101100022001
11590935522a4133
121a67a8a7609755
1388299a1c24b3a
1437934b923445b
15183b17b3cc96b
hexb6e67fa178f1

201101100022001 has 2 divisors, whose sum is σ = 201101100022002. Its totient is φ = 201101100022000.

The previous prime is 201101100021923. The next prime is 201101100022007. The reversal of 201101100022001 is 100220001101102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 119505125785600 + 81595974236401 = 10931840^2 + 9033049^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2201101100022001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8, while the sum is 11.

Adding to 201101100022001 its reverse (100220001101102), we get a palindrome (301321101123103).

The spelling of 201101100022001 in words is "two hundred one trillion, one hundred one billion, one hundred million, twenty-two thousand, one".