Base | Representation |
---|---|
bin | 1001011000010011111… |
… | …11001000100010110101 |
3 | 1010210212221200000220222 |
4 | 10230021333020202311 |
5 | 20240022230422323 |
6 | 404020311104125 |
7 | 32166435404045 |
oct | 4541177104265 |
9 | 1123787600828 |
10 | 322290092213 |
11 | 11475639a511 |
12 | 52566372045 |
13 | 24512abca9b |
14 | 11855637725 |
15 | 85b44e09c8 |
hex | 4b09fc88b5 |
322290092213 has 2 divisors, whose sum is σ = 322290092214. Its totient is φ = 322290092212.
The previous prime is 322290092191. The next prime is 322290092231. The reversal of 322290092213 is 312290092223.
Together with next prime (322290092231) 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., 261777536164 + 60512556049 = 511642^2 + 245993^2 .
It is a cyclic number.
It is not a de Polignac number, because 322290092213 - 226 = 322222983349 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 (322290092263) 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, 161145046106 + 161145046107.
It is an arithmetic number, because the mean of its divisors is an integer number (161145046107).
Almost surely, 2322290092213 is an apocalyptic number.
It is an amenable number.
322290092213 is a deficient number, since it is larger than the sum of its proper divisors (1).
322290092213 is an equidigital number, since it uses as much as digits as its factorization.
322290092213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 35.
The spelling of 322290092213 in words is "three hundred twenty-two billion, two hundred ninety million, ninety-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •