Base | Representation |
---|---|
bin | 1011101010010000010… |
… | …0011110101010100111 |
3 | 201011001201112221110111 |
4 | 2322210010132222213 |
5 | 11240224202230343 |
6 | 232005401033451 |
7 | 20321100352321 |
oct | 2724404365247 |
9 | 634051487414 |
10 | 200321133223 |
11 | 77a5706a362 |
12 | 329a7185887 |
13 | 15b75a09133 |
14 | 99a49d6611 |
15 | 5326759c9d |
hex | 2ea411eaa7 |
200321133223 has 2 divisors, whose sum is σ = 200321133224. Its totient is φ = 200321133222.
The previous prime is 200321133193. The next prime is 200321133239. The reversal of 200321133223 is 322331123002.
200321133223 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200321133223 - 25 = 200321133191 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200321133194 and 200321133203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200321133263) 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, 100160566611 + 100160566612.
It is an arithmetic number, because the mean of its divisors is an integer number (100160566612).
Almost surely, 2200321133223 is an apocalyptic number.
200321133223 is a deficient number, since it is larger than the sum of its proper divisors (1).
200321133223 is an equidigital number, since it uses as much as digits as its factorization.
200321133223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 200321133223 its reverse (322331123002), we get a palindrome (522652256225).
The spelling of 200321133223 in words is "two hundred billion, three hundred twenty-one million, one hundred thirty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •