Base | Representation |
---|---|
bin | 101101100010111001010000… |
… | …010111111101111010011001 |
3 | 222021020110012121211000102011 |
4 | 231202321100113331322121 |
5 | 202223334422000223113 |
6 | 1550005054153105521 |
7 | 60122631233163244 |
oct | 5542712027757231 |
9 | 867213177730364 |
10 | 200310033211033 |
11 | 5890900a748599 |
12 | 1a5715149b82a1 |
13 | 87a0202935645 |
14 | 37670b349225b |
15 | 18257cc4bb63d |
hex | b62e505fde99 |
200310033211033 has 2 divisors, whose sum is σ = 200310033211034. Its totient is φ = 200310033211032.
The previous prime is 200310033210983. The next prime is 200310033211049. The reversal of 200310033211033 is 330112330013002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 147446547561049 + 52863485649984 = 12142757^2 + 7270728^2 .
It is a cyclic number.
It is not a de Polignac number, because 200310033211033 - 237 = 200172594257561 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200310033210995 and 200310033211013.
It is not a weakly prime, because it can be changed into another prime (200310033211133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100155016605516 + 100155016605517.
It is an arithmetic number, because the mean of its divisors is an integer number (100155016605517).
Almost surely, 2200310033211033 is an apocalyptic number.
It is an amenable number.
200310033211033 is a deficient number, since it is larger than the sum of its proper divisors (1).
200310033211033 is an equidigital number, since it uses as much as digits as its factorization.
200310033211033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 200310033211033 its reverse (330112330013002), we get a palindrome (530422363224035).
The spelling of 200310033211033 in words is "two hundred trillion, three hundred ten billion, thirty-three million, two hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •