Base | Representation |
---|---|
bin | 1101100100110100101… |
… | …1100001101100011101 |
3 | 211021222201102002112112 |
4 | 3121031023201230131 |
5 | 12310120103214323 |
6 | 255050300243405 |
7 | 22564325436254 |
oct | 3311513415435 |
9 | 737881362475 |
10 | 233223101213 |
11 | 8aa003a6943 |
12 | 39249b40565 |
13 | 18cba38094b |
14 | b40660979b |
15 | 6100011178 |
hex | 364d2e1b1d |
233223101213 has 2 divisors, whose sum is σ = 233223101214. Its totient is φ = 233223101212.
The previous prime is 233223101191. The next prime is 233223101231. The reversal of 233223101213 is 312101322332.
Together with next prime (233223101231) 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., 176179988644 + 57043112569 = 419738^2 + 238837^2 .
It is a cyclic number.
It is not a de Polignac number, because 233223101213 - 212 = 233223097117 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 (233223101233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116611550606 + 116611550607.
It is an arithmetic number, because the mean of its divisors is an integer number (116611550607).
Almost surely, 2233223101213 is an apocalyptic number.
It is an amenable number.
233223101213 is a deficient number, since it is larger than the sum of its proper divisors (1).
233223101213 is an equidigital number, since it uses as much as digits as its factorization.
233223101213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 233223101213 its reverse (312101322332), we get a palindrome (545324423545).
The spelling of 233223101213 in words is "two hundred thirty-three billion, two hundred twenty-three million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •