Base | Representation |
---|---|
bin | 101101011110100011111001… |
… | …011001010101111001100011 |
3 | 222020011222111120222212021122 |
4 | 231132203321121111321203 |
5 | 202204000012112211321 |
6 | 1545220202420242455 |
7 | 60062256204015134 |
oct | 5536437131257143 |
9 | 866158446885248 |
10 | 200012221210211 |
11 | 58803785624483 |
12 | 1a52386024042b |
13 | 877b0c11c5c07 |
14 | 3756900b85c8b |
15 | 181cb9be588ab |
hex | b5e8f9655e63 |
200012221210211 has 4 divisors (see below), whose sum is σ = 200013830326800. Its totient is φ = 200010612093624.
The previous prime is 200012221210201. The next prime is 200012221210213. The reversal of 200012221210211 is 112012122210002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200012221210211 - 222 = 200012217015907 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200012221210211.
It is not an unprimeable number, because it can be changed into a prime (200012221210213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 804371831 + ... + 804620448.
It is an arithmetic number, because the mean of its divisors is an integer number (50003457581700).
Almost surely, 2200012221210211 is an apocalyptic number.
200012221210211 is a deficient number, since it is larger than the sum of its proper divisors (1609116589).
200012221210211 is a wasteful number, since it uses less digits than its factorization.
200012221210211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1609116588.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 200012221210211 its reverse (112012122210002), we get a palindrome (312024343420213).
The spelling of 200012221210211 in words is "two hundred trillion, twelve billion, two hundred twenty-one million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.465 sec. • engine limits •