Search a number
-
+
20010002221201 is a prime number
BaseRepresentation
bin1001000110010111100010…
…00100110000100010010001
32121211221022110101222200211
410203023301010300202101
510110320441032034301
6110320245040244121
74133450336344426
oct443136104604221
977757273358624
1020010002221201
116415215659953
1222b20a5310641
13b21c2059b215
144d26bc7dbd4d
1524a78d032051
hex1232f1130891

20010002221201 has 2 divisors, whose sum is σ = 20010002221202. Its totient is φ = 20010002221200.

The previous prime is 20010002221199. The next prime is 20010002221207. The reversal of 20010002221201 is 10212220001002.

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., 17603470531201 + 2406531690000 = 4195649^2 + 1551300^2 .

It is a cyclic number.

It is not a de Polignac number, because 20010002221201 - 21 = 20010002221199 is a prime.

Together with 20010002221199, it forms a pair of twin primes.

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

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

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

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

Almost surely, 220010002221201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 32, while the sum is 13.

Adding to 20010002221201 its reverse (10212220001002), we get a palindrome (30222222222203).

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