Base | Representation |
---|---|
bin | 101101100001011100010001… |
… | …110110111000010101000011 |
3 | 222020212220112002012121211012 |
4 | 231201130101312320111003 |
5 | 202220220442211232321 |
6 | 1545451143551111135 |
7 | 60112465253565035 |
oct | 5541342166702503 |
9 | 866786462177735 |
10 | 200210200102211 |
11 | 5887a73a541292 |
12 | 1a5560b2b124ab |
13 | 879398288a1a0 |
14 | 3762322675c55 |
15 | 1822dd7c4b05b |
hex | b61711db8543 |
200210200102211 has 8 divisors (see below), whose sum is σ = 215635787675280. Its totient is φ = 184788155807712.
The previous prime is 200210200102201. The next prime is 200210200102259. The reversal of 200210200102211 is 112201002012002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200210200102211 - 218 = 200210199840067 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200210200102201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 885702281 + ... + 885928298.
It is an arithmetic number, because the mean of its divisors is an integer number (26954473459410).
Almost surely, 2200210200102211 is an apocalyptic number.
200210200102211 is a deficient number, since it is larger than the sum of its proper divisors (15425587573069).
200210200102211 is a wasteful number, since it uses less digits than its factorization.
200210200102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1771639285.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 200210200102211 its reverse (112201002012002), we get a palindrome (312411202114213).
The spelling of 200210200102211 in words is "two hundred trillion, two hundred ten billion, two hundred million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •