Base | Representation |
---|---|
bin | 101101100001011100010001… |
… | …111110111011001110001011 |
3 | 222020212220112020011202211022 |
4 | 231201130101332323032023 |
5 | 202220220443231224321 |
6 | 1545451144104223055 |
7 | 60112465310530523 |
oct | 5541342176731613 |
9 | 866786466152738 |
10 | 200210202211211 |
11 | 5887a740751865 |
12 | 1a5560b376aa8b |
13 | 879398314810a |
14 | 3762322a64683 |
15 | 1822dd8015dab |
hex | b61711fbb38b |
200210202211211 has 4 divisors (see below), whose sum is σ = 200218414639800. Its totient is φ = 200201989782624.
The previous prime is 200210202211207. The next prime is 200210202211259. The reversal of 200210202211211 is 112112202012002.
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 200210202211211 - 22 = 200210202211207 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 200210202211211.
It is not an unprimeable number, because it can be changed into a prime (200210202111211) 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, 4106177726 + ... + 4106226483.
It is an arithmetic number, because the mean of its divisors is an integer number (50054603659950).
Almost surely, 2200210202211211 is an apocalyptic number.
200210202211211 is a deficient number, since it is larger than the sum of its proper divisors (8212428589).
200210202211211 is an equidigital number, since it uses as much as digits as its factorization.
200210202211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8212428588.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 200210202211211 its reverse (112112202012002), we get a palindrome (312322404223213).
The spelling of 200210202211211 in words is "two hundred trillion, two hundred ten billion, two hundred two million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •