Search a number
-
+
211013101301 is a prime number
BaseRepresentation
bin1100010010000101011…
…1000110011011110101
3202011122212101012100012
43010201113012123311
511424123323220201
6240534343030005
721150046524032
oct3044127063365
9664585335305
10211013101301
1181543438212
1234a8ba3b305
1316b8ab82b72
14a2daa02389
1557502505bb
hex31215c66f5

211013101301 has 2 divisors, whose sum is σ = 211013101302. Its totient is φ = 211013101300.

The previous prime is 211013101289. The next prime is 211013101373. The reversal of 211013101301 is 103101310112.

It is a happy number.

211013101301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 189908566225 + 21104535076 = 435785^2 + 145274^2 .

It is a cyclic number.

It is not a de Polignac number, because 211013101301 - 26 = 211013101237 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2211013101301 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 18, while the sum is 14.

Adding to 211013101301 its reverse (103101310112), we get a palindrome (314114411413).

The spelling of 211013101301 in words is "two hundred eleven billion, thirteen million, one hundred one thousand, three hundred one".