Base | Representation |
---|---|
bin | 10111111110010… |
… | …11001011000101 |
3 | 112000102110100102 |
4 | 23333023023011 |
5 | 402441011323 |
6 | 31542253445 |
7 | 4661260103 |
oct | 1377131305 |
9 | 460373312 |
10 | 201110213 |
11 | a3581097 |
12 | 57427285 |
13 | 32885735 |
14 | 1c9d0c73 |
15 | 129c8328 |
hex | bfcb2c5 |
201110213 has 2 divisors, whose sum is σ = 201110214. Its totient is φ = 201110212.
The previous prime is 201110201. The next prime is 201110257. The reversal of 201110213 is 312011102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 200024449 + 1085764 = 14143^2 + 1042^2 .
It is a cyclic number.
It is not a de Polignac number, because 201110213 - 26 = 201110149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201110194 and 201110203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201110263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100555106 + 100555107.
It is an arithmetic number, because the mean of its divisors is an integer number (100555107).
Almost surely, 2201110213 is an apocalyptic number.
It is an amenable number.
201110213 is a deficient number, since it is larger than the sum of its proper divisors (1).
201110213 is an equidigital number, since it uses as much as digits as its factorization.
201110213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 201110213 is about 14181.3332589006. Note that the first 3 decimals coincide. The cubic root of 201110213 is about 585.8836457047.
Adding to 201110213 its reverse (312011102), we get a palindrome (513121315).
The spelling of 201110213 in words is "two hundred one million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •