Search a number
-
+
20001101112101 is a prime number
BaseRepresentation
bin1001000110000110111101…
…00001101110001100100101
32121211002100010101210111102
410203003132201232030211
510110144223341041401
6110312213510445445
74133013634226144
oct443033641561445
977732303353442
1020001101112101
11641146817193a
1222b0420363885
13b21132463965
144d20b65a975b
1524a41b88b56b
hex1230de86e325

20001101112101 has 2 divisors, whose sum is σ = 20001101112102. Its totient is φ = 20001101112100.

The previous prime is 20001101112079. The next prime is 20001101112103. The reversal of 20001101112101 is 10121110110002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13178170530625 + 6822930581476 = 3630175^2 + 2612074^2 .

It is a cyclic number.

It is not a de Polignac number, because 20001101112101 - 26 = 20001101112037 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 220001101112101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 20001101112101 its reverse (10121110110002), we get a palindrome (30122211222103).

The spelling of 20001101112101 in words is "twenty trillion, one billion, one hundred one million, one hundred twelve thousand, one hundred one".