Base | Representation |
---|---|
bin | 1011101001000100001… |
… | …1100000101011010011 |
3 | 201010020111020222220110 |
4 | 2322101003200223103 |
5 | 11234101020042321 |
6 | 231514003212403 |
7 | 20310144622026 |
oct | 2722103405323 |
9 | 633214228813 |
10 | 200002112211 |
11 | 77902a84130 |
12 | 32918377103 |
13 | 15b248ab6c5 |
14 | 99744b11bd |
15 | 5308740176 |
hex | 2e910e0ad3 |
200002112211 has 64 divisors (see below), whose sum is σ = 308223843840. Its totient is φ = 114231936000.
The previous prime is 200002112179. The next prime is 200002112237. The reversal of 200002112211 is 112211200002.
It is not a de Polignac number, because 200002112211 - 25 = 200002112179 is a prime.
It is a super-3 number, since 3×2000021122113 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (200002112281) 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 63 ways as a sum of consecutive naturals, for example, 7634311 + ... + 7660463.
It is an arithmetic number, because the mean of its divisors is an integer number (4815997560).
Almost surely, 2200002112211 is an apocalyptic number.
200002112211 is a deficient number, since it is larger than the sum of its proper divisors (108221731629).
200002112211 is a wasteful number, since it uses less digits than its factorization.
200002112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26388.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 200002112211 its reverse (112211200002), we get a palindrome (312213312213).
It can be divided in two parts, 200002 and 112211, that multiplied together give a palindrome (22442424422).
The spelling of 200002112211 in words is "two hundred billion, two million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •