Base | Representation |
---|---|
bin | 100001101010011100110… |
… | …100001001001110010101 |
3 | 22012011002110221200010101 |
4 | 201222130310021032111 |
5 | 300400141232221323 |
6 | 4530420455054101 |
7 | 326063210532523 |
oct | 41523464111625 |
9 | 8164073850111 |
10 | 2313323320213 |
11 | 812090784824 |
12 | 314407371331 |
13 | 13a1b77391b9 |
14 | 7dd73281313 |
15 | 402951a6dad |
hex | 21a9cd09395 |
2313323320213 has 2 divisors, whose sum is σ = 2313323320214. Its totient is φ = 2313323320212.
The previous prime is 2313323320097. The next prime is 2313323320219. The reversal of 2313323320213 is 3120233233132.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2308752613764 + 4570706449 = 1519458^2 + 67607^2 .
It is a cyclic number.
It is not a de Polignac number, because 2313323320213 - 29 = 2313323319701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2313323320219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1156661660106 + 1156661660107.
It is an arithmetic number, because the mean of its divisors is an integer number (1156661660107).
Almost surely, 22313323320213 is an apocalyptic number.
It is an amenable number.
2313323320213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2313323320213 is an equidigital number, since it uses as much as digits as its factorization.
2313323320213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 2313323320213 its reverse (3120233233132), we get a palindrome (5433556553345).
The spelling of 2313323320213 in words is "two trillion, three hundred thirteen billion, three hundred twenty-three million, three hundred twenty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •