Search a number
-
+
20010100310201 is a prime number
BaseRepresentation
bin1001000110010111101101…
…11010111100000010111001
32121211221120021222102111202
410203023312322330002321
510110321141134411301
6110320302502503545
74133452640160251
oct443136672740271
977757507872452
1020010100310201
116415265a65641
1222b2112134bb5
13b21c379c2c51
144d26cb852961
1524a79695a66b
hex1232f6ebc0b9

20010100310201 has 2 divisors, whose sum is σ = 20010100310202. Its totient is φ = 20010100310200.

The previous prime is 20010100310141. The next prime is 20010100310203. The reversal of 20010100310201 is 10201300101002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 19249805251600 + 760295058601 = 4387460^2 + 871949^2 .

It is a cyclic number.

It is not a de Polignac number, because 20010100310201 - 238 = 19735222403257 is a prime.

It is a super-2 number, since 2×200101003102012 (a number of 27 digits) contains 22 as substring.

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

It is a Chen prime.

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

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

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

Almost surely, 220010100310201 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 20010100310201 its reverse (10201300101002), we get a palindrome (30211400411203).

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