Base | Representation |
---|---|
bin | 100001101001011010101… |
… | …001011011000000010111 |
3 | 22012001020010002101121002 |
4 | 201221122221123000113 |
5 | 300340403040310312 |
6 | 4530114401413515 |
7 | 326023541013122 |
oct | 41513251330027 |
9 | 8161203071532 |
10 | 2312213213207 |
11 | 811671096a17 |
12 | 31415763a29b |
13 | 13a06b75a051 |
14 | 7dca9a713b9 |
15 | 4022c9c64c2 |
hex | 21a5aa5b017 |
2312213213207 has 2 divisors, whose sum is σ = 2312213213208. Its totient is φ = 2312213213206.
The previous prime is 2312213213203. The next prime is 2312213213209. The reversal of 2312213213207 is 7023123122132.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2312213213207 - 22 = 2312213213203 is a prime.
Together with 2312213213209, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2312213213207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2312213213203) 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, 1156106606603 + 1156106606604.
It is an arithmetic number, because the mean of its divisors is an integer number (1156106606604).
Almost surely, 22312213213207 is an apocalyptic number.
2312213213207 is a deficient number, since it is larger than the sum of its proper divisors (1).
2312213213207 is an equidigital number, since it uses as much as digits as its factorization.
2312213213207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 29.
Adding to 2312213213207 its reverse (7023123122132), we get a palindrome (9335336335339).
The spelling of 2312213213207 in words is "two trillion, three hundred twelve billion, two hundred thirteen million, two hundred thirteen thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •