Base | Representation |
---|---|
bin | 101101100001011101001101… |
… | …011101001110111011100011 |
3 | 222020220000002202201022012012 |
4 | 231201131031131032323203 |
5 | 202220230014200341003 |
6 | 1545451431110423135 |
7 | 60112532114641655 |
oct | 5541351535167343 |
9 | 866800082638165 |
10 | 200211200012003 |
11 | 58880102a03314 |
12 | 1a556331961aab |
13 | 8793ab1a9529b |
14 | 37623b939c6d5 |
15 | 1822e459108d8 |
hex | b6174d74eee3 |
200211200012003 has 4 divisors (see below), whose sum is σ = 200409625384680. Its totient is φ = 200012774639328.
The previous prime is 200211200011957. The next prime is 200211200012081. The reversal of 200211200012003 is 300210002112002.
It is a happy number.
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 200211200012003 - 216 = 200211199946467 is a prime.
It is a super-2 number, since 2×2002112000120032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200211200012503) 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, 99212684825 + ... + 99212686842.
It is an arithmetic number, because the mean of its divisors is an integer number (50102406346170).
Almost surely, 2200211200012003 is an apocalyptic number.
200211200012003 is a deficient number, since it is larger than the sum of its proper divisors (198425372677).
200211200012003 is a wasteful number, since it uses less digits than its factorization.
200211200012003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 198425372676.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 200211200012003 its reverse (300210002112002), we get a palindrome (500421202124005).
The spelling of 200211200012003 in words is "two hundred trillion, two hundred eleven billion, two hundred million, twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •