Base | Representation |
---|---|
bin | 10111110101111… |
… | …00001011010011 |
3 | 111221100001201020 |
4 | 23322330023103 |
5 | 402200001321 |
6 | 31502410523 |
7 | 4645654665 |
oct | 1372741323 |
9 | 457301636 |
10 | 200000211 |
11 | a2993134 |
12 | 56b90a43 |
13 | 32587428 |
14 | 1c7c2535 |
15 | 128594c6 |
hex | bebc2d3 |
200000211 has 8 divisors (see below), whose sum is σ = 275862480. Its totient is φ = 128735712.
The previous prime is 200000209. The next prime is 200000221. The reversal of 200000211 is 112000002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200000211 - 21 = 200000209 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200000211.
It is not an unprimeable number, because it can be changed into a prime (200000201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1149340 + ... + 1149513.
It is an arithmetic number, because the mean of its divisors is an integer number (34482810).
Almost surely, 2200000211 is an apocalyptic number.
200000211 is a deficient number, since it is larger than the sum of its proper divisors (75862269).
200000211 is a wasteful number, since it uses less digits than its factorization.
200000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2298885.
The product of its (nonzero) digits is 4, while the sum is 6.
The square root of 200000211 is about 14142.1430837055. The cubic root of 200000211 is about 584.8037532984.
Adding to 200000211 its reverse (112000002), we get a palindrome (312000213).
It can be divided in two parts, 2000002 and 11, that multiplied together give a palindrome (22000022).
The spelling of 200000211 in words is "two hundred million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •