Base | Representation |
---|---|
bin | 100001001011011… |
… | …1110101100010101 |
3 | 2212120220112012222 |
4 | 1002112332230111 |
5 | 4240002221323 |
6 | 302250152125 |
7 | 36406031345 |
oct | 10226765425 |
9 | 2776815188 |
10 | 1113320213 |
11 | 521492a55 |
12 | 270a22645 |
13 | 149865875 |
14 | a7c08d25 |
15 | 67b179c8 |
hex | 425beb15 |
1113320213 has 2 divisors, whose sum is σ = 1113320214. Its totient is φ = 1113320212.
The previous prime is 1113320177. The next prime is 1113320231. The reversal of 1113320213 is 3120233111.
Together with next prime (1113320231) 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., 1073086564 + 40233649 = 32758^2 + 6343^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113320213 - 210 = 1113319189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1113320191 and 1113320200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1113320413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556660106 + 556660107.
It is an arithmetic number, because the mean of its divisors is an integer number (556660107).
Almost surely, 21113320213 is an apocalyptic number.
It is an amenable number.
1113320213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113320213 is an equidigital number, since it uses as much as digits as its factorization.
1113320213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1113320213 is about 33366.4534075769. The cubic root of 1113320213 is about 1036.4301335618.
Adding to 1113320213 its reverse (3120233111), we get a palindrome (4233553324).
The spelling of 1113320213 in words is "one billion, one hundred thirteen million, three hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •