Base | Representation |
---|---|
bin | 1100111011011011001… |
… | …0011111011001011101 |
3 | 210020022020012010200222 |
4 | 3032312302133121131 |
5 | 12114340131134323 |
6 | 250011432331125 |
7 | 22022044013153 |
oct | 3166662373135 |
9 | 706266163628 |
10 | 222110021213 |
11 | 86218353403 |
12 | 37068243aa5 |
13 | 17c38bb3072 |
14 | aa707013d3 |
15 | 5b9e5869c8 |
hex | 33b6c9f65d |
222110021213 has 2 divisors, whose sum is σ = 222110021214. Its totient is φ = 222110021212.
The previous prime is 222110021191. The next prime is 222110021249. The reversal of 222110021213 is 312120011222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 154856416324 + 67253604889 = 393518^2 + 259333^2 .
It is a cyclic number.
It is not a de Polignac number, because 222110021213 - 214 = 222110004829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 222110021191 and 222110021200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222110021113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111055010606 + 111055010607.
It is an arithmetic number, because the mean of its divisors is an integer number (111055010607).
Almost surely, 2222110021213 is an apocalyptic number.
It is an amenable number.
222110021213 is a deficient number, since it is larger than the sum of its proper divisors (1).
222110021213 is an equidigital number, since it uses as much as digits as its factorization.
222110021213 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 222110021213 its reverse (312120011222), we get a palindrome (534230032435).
Subtracting 222110021213 from its reverse (312120011222), we obtain a palindrome (90009990009).
The spelling of 222110021213 in words is "two hundred twenty-two billion, one hundred ten million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •