Base | Representation |
---|---|
bin | 1100111111001001100… |
… | …1011111100011011101 |
3 | 210022212221000110112222 |
4 | 3033302121133203131 |
5 | 12123412141214323 |
6 | 250254555435125 |
7 | 22055606366246 |
oct | 3176231374335 |
9 | 708787013488 |
10 | 223110101213 |
11 | 866909212aa |
12 | 372a7155aa5 |
13 | 1806814a78c |
14 | ab2746dccd |
15 | 5c0c2819c8 |
hex | 33f265f8dd |
223110101213 has 2 divisors, whose sum is σ = 223110101214. Its totient is φ = 223110101212.
The previous prime is 223110101197. The next prime is 223110101219. The reversal of 223110101213 is 312101011322.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 153947939044 + 69162162169 = 392362^2 + 262987^2 .
It is a cyclic number.
It is not a de Polignac number, because 223110101213 - 24 = 223110101197 is a prime.
It is a super-3 number, since 3×2231101012133 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 223110101191 and 223110101200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (223110101219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111555050606 + 111555050607.
It is an arithmetic number, because the mean of its divisors is an integer number (111555050607).
Almost surely, 2223110101213 is an apocalyptic number.
It is an amenable number.
223110101213 is a deficient number, since it is larger than the sum of its proper divisors (1).
223110101213 is an equidigital number, since it uses as much as digits as its factorization.
223110101213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 223110101213 its reverse (312101011322), we get a palindrome (535211112535).
The spelling of 223110101213 in words is "two hundred twenty-three billion, one hundred ten million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •