Search a number
-
+
212020120011113 is a prime number
BaseRepresentation
bin110000001101010011000111…
…111100000100000101101001
31000210200220222201001121220122
4300031103013330010011221
5210242214201210323423
62030532410513133025
762441643136522541
oct6015230774040551
91023626881047818
10212020120011113
1161613256436307
121b942b0525a175
13913c54718538b
143a4db85808321
15197a1e35348c8
hexc0d4c7f04169

212020120011113 has 2 divisors, whose sum is σ = 212020120011114. Its totient is φ = 212020120011112.

The previous prime is 212020120011107. The next prime is 212020120011173. The reversal of 212020120011113 is 311110021020212.

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., 203836383928384 + 8183736082729 = 14277128^2 + 2860723^2 .

It is a cyclic number.

It is not a de Polignac number, because 212020120011113 - 210 = 212020120010089 is a prime.

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

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

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

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

Almost surely, 2212020120011113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48, while the sum is 17.

Adding to 212020120011113 its reverse (311110021020212), we get a palindrome (523130141031325).

The spelling of 212020120011113 in words is "two hundred twelve trillion, twenty billion, one hundred twenty million, eleven thousand, one hundred thirteen".