Base | Representation |
---|---|
bin | 1011101001001001000… |
… | …0001001001010010101 |
3 | 201010021220001121111222 |
4 | 2322102100021022111 |
5 | 11234121140412411 |
6 | 231520001540125 |
7 | 20310510440621 |
oct | 2722220111225 |
9 | 633256047458 |
10 | 200022200981 |
11 | 77913355119 |
12 | 32923044645 |
13 | 15b28ac3355 |
14 | 9977020181 |
15 | 530a3ac4db |
hex | 2e92409295 |
200022200981 has 2 divisors, whose sum is σ = 200022200982. Its totient is φ = 200022200980.
The previous prime is 200022200977. The next prime is 200022200993. The reversal of 200022200981 is 189002220002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108416098756 + 91606102225 = 329266^2 + 302665^2 .
It is a cyclic number.
It is not a de Polignac number, because 200022200981 - 22 = 200022200977 is a prime.
It is a super-2 number, since 2×2000222009812 (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 200022200981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200022200941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100011100490 + 100011100491.
It is an arithmetic number, because the mean of its divisors is an integer number (100011100491).
Almost surely, 2200022200981 is an apocalyptic number.
It is an amenable number.
200022200981 is a deficient number, since it is larger than the sum of its proper divisors (1).
200022200981 is an equidigital number, since it uses as much as digits as its factorization.
200022200981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 200022200981 its reverse (189002220002), we get a palindrome (389024420983).
The spelling of 200022200981 in words is "two hundred billion, twenty-two million, two hundred thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •