Base | Representation |
---|---|
bin | 101101100001010100110101… |
… | …000001010010110100000101 |
3 | 222020212010212112210102000202 |
4 | 231201110311001102310011 |
5 | 202220103101211200401 |
6 | 1545443342051220245 |
7 | 60112063102645523 |
oct | 5541246501226405 |
9 | 866763775712022 |
10 | 200202200100101 |
11 | 588773047722a1 |
12 | 1a55463b8a7685 |
13 | 8792ca9346124 |
14 | 3761ba3dab313 |
15 | 1822aba75006b |
hex | b61535052d05 |
200202200100101 has 16 divisors (see below), whose sum is σ = 204998109421248. Its totient is φ = 195412681094400.
The previous prime is 200202200099959. The next prime is 200202200100121. The reversal of 200202200100101 is 101001002202002.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200202200100101 is a prime.
It is a super-3 number, since 3×2002022001001013 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200202200100121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 708586781 + ... + 708869261.
It is an arithmetic number, because the mean of its divisors is an integer number (12812381838828).
Almost surely, 2200202200100101 is an apocalyptic number.
It is an amenable number.
200202200100101 is a deficient number, since it is larger than the sum of its proper divisors (4795909321147).
200202200100101 is a wasteful number, since it uses less digits than its factorization.
200202200100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 293732.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 200202200100101 its reverse (101001002202002), we get a palindrome (301203202302103).
The spelling of 200202200100101 in words is "two hundred trillion, two hundred two billion, two hundred million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •