Base | Representation |
---|---|
bin | 1100111011000011110… |
… | …0111111010110000101 |
3 | 210020001101221202001122 |
4 | 3032300330333112011 |
5 | 12114140100011323 |
6 | 245554014003325 |
7 | 22016444541305 |
oct | 3166074772605 |
9 | 706041852048 |
10 | 222012110213 |
11 | 86178059423 |
12 | 3703b4a6545 |
13 | 17c2182136a |
14 | aa616d5605 |
15 | 5b95b95ec8 |
hex | 33b0f3f585 |
222012110213 has 2 divisors, whose sum is σ = 222012110214. Its totient is φ = 222012110212.
The previous prime is 222012110171. The next prime is 222012110231. The reversal of 222012110213 is 312011210222.
Together with next prime (222012110231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 196814675044 + 25197435169 = 443638^2 + 158737^2 .
It is a cyclic number.
It is not a de Polignac number, because 222012110213 - 226 = 221945001349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 222012110191 and 222012110200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222012110813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111006055106 + 111006055107.
It is an arithmetic number, because the mean of its divisors is an integer number (111006055107).
Almost surely, 2222012110213 is an apocalyptic number.
It is an amenable number.
222012110213 is a deficient number, since it is larger than the sum of its proper divisors (1).
222012110213 is an equidigital number, since it uses as much as digits as its factorization.
222012110213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 222012110213 its reverse (312011210222), we get a palindrome (534023320435).
The spelling of 222012110213 in words is "two hundred twenty-two billion, twelve million, one hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.547 sec. • engine limits •