Base | Representation |
---|---|
bin | 1011101001111000001… |
… | …0110011110011010001 |
3 | 201010210200022110221111 |
4 | 2322132002303303101 |
5 | 11240022312012314 |
6 | 231551350053321 |
7 | 20315432123221 |
oct | 2723602636321 |
9 | 633720273844 |
10 | 200220032209 |
11 | 77a04a966aa |
12 | 3297934a241 |
13 | 15b5aa9b452 |
14 | 99953da081 |
15 | 531c938ec4 |
hex | 2e9e0b3cd1 |
200220032209 has 2 divisors, whose sum is σ = 200220032210. Its totient is φ = 200220032208.
The previous prime is 200220032183. The next prime is 200220032231. The reversal of 200220032209 is 902230022002.
It is an a-pointer prime, because the next prime (200220032231) can be obtained adding 200220032209 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 147227992209 + 52992040000 = 383703^2 + 230200^2 .
It is a cyclic number.
It is not a de Polignac number, because 200220032209 - 27 = 200220032081 is a prime.
It is a super-2 number, since 2×2002200322092 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 200220032209.
It is not a weakly prime, because it can be changed into another prime (200220032809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100110016104 + 100110016105.
It is an arithmetic number, because the mean of its divisors is an integer number (100110016105).
Almost surely, 2200220032209 is an apocalyptic number.
It is an amenable number.
200220032209 is a deficient number, since it is larger than the sum of its proper divisors (1).
200220032209 is an equidigital number, since it uses as much as digits as its factorization.
200220032209 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 22.
The spelling of 200220032209 in words is "two hundred billion, two hundred twenty million, thirty-two thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •