Base | Representation |
---|---|
bin | 1100111011011110010… |
… | …0011101111000100101 |
3 | 210020100010211201220012 |
4 | 3032313210131320211 |
5 | 12114402004402323 |
6 | 250013021220005 |
7 | 22022263246406 |
oct | 3166744357045 |
9 | 706303751805 |
10 | 222123122213 |
11 | 86224791383 |
12 | 37070701605 |
13 | 17c3b81c235 |
14 | aa723519ad |
15 | 5ba07c3678 |
hex | 33b791de25 |
222123122213 has 2 divisors, whose sum is σ = 222123122214. Its totient is φ = 222123122212.
The previous prime is 222123122191. The next prime is 222123122231. The reversal of 222123122213 is 312221321222.
It is a happy number.
Together with next prime (222123122231) 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., 209340106369 + 12783015844 = 457537^2 + 113062^2 .
It is a cyclic number.
It is not a de Polignac number, because 222123122213 - 212 = 222123118117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222123622213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111061561106 + 111061561107.
It is an arithmetic number, because the mean of its divisors is an integer number (111061561107).
Almost surely, 2222123122213 is an apocalyptic number.
It is an amenable number.
222123122213 is a deficient number, since it is larger than the sum of its proper divisors (1).
222123122213 is an equidigital number, since it uses as much as digits as its factorization.
222123122213 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1152, while the sum is 23.
Adding to 222123122213 its reverse (312221321222), we get a palindrome (534344443435).
The spelling of 222123122213 in words is "two hundred twenty-two billion, one hundred twenty-three million, one hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •