Base | Representation |
---|---|
bin | 101101100011000100101100… |
… | …010100001001100010110101 |
3 | 222021021121220102122122102201 |
4 | 231203010230110021202311 |
5 | 202224040044130212323 |
6 | 1550014444502304501 |
7 | 60123544443611566 |
oct | 5543045424114265 |
9 | 867247812578381 |
10 | 200322313132213 |
11 | 5891324140a088 |
12 | 1a573981428131 |
13 | 87a140ba879ac |
14 | 376791a33816d |
15 | 1825c9a5d18ad |
hex | b6312c5098b5 |
200322313132213 has 2 divisors, whose sum is σ = 200322313132214. Its totient is φ = 200322313132212.
The previous prime is 200322313132199. The next prime is 200322313132219. The reversal of 200322313132213 is 312231313223002.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121547582119044 + 78774731013169 = 11024862^2 + 8875513^2 .
It is a cyclic number.
It is not a de Polignac number, because 200322313132213 - 29 = 200322313131701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200322313132219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100161156566106 + 100161156566107.
It is an arithmetic number, because the mean of its divisors is an integer number (100161156566107).
Almost surely, 2200322313132213 is an apocalyptic number.
It is an amenable number.
200322313132213 is a deficient number, since it is larger than the sum of its proper divisors (1).
200322313132213 is an equidigital number, since it uses as much as digits as its factorization.
200322313132213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 200322313132213 its reverse (312231313223002), we get a palindrome (512553626355215).
The spelling of 200322313132213 in words is "two hundred trillion, three hundred twenty-two billion, three hundred thirteen million, one hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •