Base | Representation |
---|---|
bin | 1011101001110110010… |
… | …0101000100101111101 |
3 | 201010210010102121011002 |
4 | 2322131210220211331 |
5 | 11240013300400411 |
6 | 231550504340045 |
7 | 20315304646304 |
oct | 2723544504575 |
9 | 633703377132 |
10 | 200212121981 |
11 | 77a00583623 |
12 | 32976774625 |
13 | 15b5925bb41 |
14 | 999433b43b |
15 | 531bdc533b |
hex | 2e9d92897d |
200212121981 has 2 divisors, whose sum is σ = 200212121982. Its totient is φ = 200212121980.
The previous prime is 200212121899. The next prime is 200212122017. The reversal of 200212121981 is 189121212002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 156558705625 + 43653416356 = 395675^2 + 208934^2 .
It is a cyclic number.
It is not a de Polignac number, because 200212121981 - 230 = 199138380157 is a prime.
It is a super-2 number, since 2×2002121219812 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200212121381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100106060990 + 100106060991.
It is an arithmetic number, because the mean of its divisors is an integer number (100106060991).
Almost surely, 2200212121981 is an apocalyptic number.
It is an amenable number.
200212121981 is a deficient number, since it is larger than the sum of its proper divisors (1).
200212121981 is an equidigital number, since it uses as much as digits as its factorization.
200212121981 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 29.
Adding to 200212121981 its reverse (189121212002), we get a palindrome (389333333983).
The spelling of 200212121981 in words is "two hundred billion, two hundred twelve million, one hundred twenty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •