Base | Representation |
---|---|
bin | 1100010110100010110… |
… | …1010101101010110001 |
3 | 202021202021202200222021 |
4 | 3011220231111222301 |
5 | 11434101242110301 |
6 | 241253223111441 |
7 | 21221523125452 |
oct | 3055055255261 |
9 | 667667680867 |
10 | 212210113201 |
11 | 81aa8092a49 |
12 | 351648a2581 |
13 | 1701bb6c228 |
14 | a3b1995129 |
15 | 57c039a8a1 |
hex | 3168b55ab1 |
212210113201 has 2 divisors, whose sum is σ = 212210113202. Its totient is φ = 212210113200.
The previous prime is 212210113163. The next prime is 212210113207. The reversal of 212210113201 is 102311012212.
212210113201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 166745639025 + 45464474176 = 408345^2 + 213224^2 .
It is a cyclic number.
It is not a de Polignac number, because 212210113201 - 235 = 177850374833 is a prime.
It is not a weakly prime, because it can be changed into another prime (212210113207) 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, 106105056600 + 106105056601.
It is an arithmetic number, because the mean of its divisors is an integer number (106105056601).
Almost surely, 2212210113201 is an apocalyptic number.
It is an amenable number.
212210113201 is a deficient number, since it is larger than the sum of its proper divisors (1).
212210113201 is an equidigital number, since it uses as much as digits as its factorization.
212210113201 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 16.
Adding to 212210113201 its reverse (102311012212), we get a palindrome (314521125413).
The spelling of 212210113201 in words is "two hundred twelve billion, two hundred ten million, one hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •