Search a number
-
+
202120010020111 is a prime number
BaseRepresentation
bin101101111101001110111011…
…011001100011010100001111
3222111122111002000111121001011
4231331032323121203110033
5202443013240031120421
61553512352321430051
760400455161210251
oct5575167331432417
9874574060447034
10202120010020111
1159446684442537
121a80426649b327
1388a1ab1b08371
1437ca936ca7cd1
151857912d514e1
hexb7d3bb66350f

202120010020111 has 2 divisors, whose sum is σ = 202120010020112. Its totient is φ = 202120010020110.

The previous prime is 202120010020109. The next prime is 202120010020151. The reversal of 202120010020111 is 111020010021202.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 202120010020111 - 21 = 202120010020109 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 202120010020091 and 202120010020100.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (202120010020151) 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, 101060005010055 + 101060005010056.

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

Almost surely, 2202120010020111 is an apocalyptic number.

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

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

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

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

Adding to 202120010020111 its reverse (111020010021202), we get a palindrome (313140020041313).

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