Base | Representation |
---|---|
bin | 1011101001001011001… |
… | …0110111011000110101 |
3 | 201010022112012001102222 |
4 | 2322102302313120311 |
5 | 11234131003200341 |
6 | 231520525012125 |
7 | 20310651011021 |
oct | 2722262673065 |
9 | 633275161388 |
10 | 200031303221 |
11 | 77918501832 |
12 | 329260b4045 |
13 | 15b2a95c3a9 |
14 | 997830d381 |
15 | 530b0a944b |
hex | 2e92cb7635 |
200031303221 has 2 divisors, whose sum is σ = 200031303222. Its totient is φ = 200031303220.
The previous prime is 200031303211. The next prime is 200031303223. The reversal of 200031303221 is 122303130002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134605336996 + 65425966225 = 366886^2 + 255785^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200031303221 is a prime.
Together with 200031303223, 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 200031303221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200031303223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100015651610 + 100015651611.
It is an arithmetic number, because the mean of its divisors is an integer number (100015651611).
Almost surely, 2200031303221 is an apocalyptic number.
It is an amenable number.
200031303221 is a deficient number, since it is larger than the sum of its proper divisors (1).
200031303221 is an equidigital number, since it uses as much as digits as its factorization.
200031303221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 200031303221 its reverse (122303130002), we get a palindrome (322334433223).
The spelling of 200031303221 in words is "two hundred billion, thirty-one million, three hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •