Base | Representation |
---|---|
bin | 1011101001111000001… |
… | …1000100110111010001 |
3 | 201010210200110000210221 |
4 | 2322132003010313101 |
5 | 11240022321231342 |
6 | 231551351353041 |
7 | 20315432534041 |
oct | 2723603046721 |
9 | 633720400727 |
10 | 200220102097 |
11 | 77a05034164 |
12 | 32979382781 |
13 | 15b5aac41c2 |
14 | 9995417721 |
15 | 531c94ea67 |
hex | 2e9e0c4dd1 |
200220102097 has 2 divisors, whose sum is σ = 200220102098. Its totient is φ = 200220102096.
The previous prime is 200220102077. The next prime is 200220102133. The reversal of 200220102097 is 790201022002.
200220102097 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 182581871616 + 17638230481 = 427296^2 + 132809^2 .
It is a cyclic number.
It is not a de Polignac number, because 200220102097 - 219 = 200219577809 is a prime.
It is not a weakly prime, because it can be changed into another prime (200220102077) 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, 100110051048 + 100110051049.
It is an arithmetic number, because the mean of its divisors is an integer number (100110051049).
Almost surely, 2200220102097 is an apocalyptic number.
It is an amenable number.
200220102097 is a deficient number, since it is larger than the sum of its proper divisors (1).
200220102097 is an equidigital number, since it uses as much as digits as its factorization.
200220102097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 25.
Adding to 200220102097 its reverse (790201022002), we get a palindrome (990421124099).
The spelling of 200220102097 in words is "two hundred billion, two hundred twenty million, one hundred two thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •