Search a number
-
+
202201222110001 is a prime number
BaseRepresentation
bin101101111110011010100100…
…000001000101101100110001
3222111221020200211101012210021
4231332122210001011230301
5203000331100330010001
61554013543054403441
760406361531452522
oct5576324401055461
9874836624335707
10202201222110001
11594780695626a4
121a817b50200581
1388a96550a851a
1437d083c9dc849
151859ab7947ba1
hexb7e6a4045b31

202201222110001 has 2 divisors, whose sum is σ = 202201222110002. Its totient is φ = 202201222110000.

The previous prime is 202201222109981. The next prime is 202201222110029. The reversal of 202201222110001 is 100011222102202.

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., 162873774364401 + 39327447745600 = 12762201^2 + 6271160^2 .

It is a cyclic number.

It is not a de Polignac number, because 202201222110001 - 25 = 202201222109969 is a prime.

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

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

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

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

Almost surely, 2202201222110001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 64, while the sum is 16.

Adding to 202201222110001 its reverse (100011222102202), we get a palindrome (302212444212203).

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