Base | Representation |
---|---|
bin | 1011101101001111010… |
… | …0010110000110011000 |
3 | 201020010112220212111011 |
4 | 2323103310112012120 |
5 | 11243344241211300 |
6 | 232221054543304 |
7 | 20346665402602 |
oct | 2732364260630 |
9 | 636115825434 |
10 | 201122210200 |
11 | 7832827634a |
12 | 32b8b507b34 |
13 | 15c72978292 |
14 | 9a3d162172 |
15 | 5371c45eba |
hex | 2ed3d16198 |
201122210200 has 24 divisors (see below), whose sum is σ = 467609139180. Its totient is φ = 80448884000.
The previous prime is 201122210189. The next prime is 201122210203. The reversal of 201122210200 is 2012221102.
It is a happy number.
201122210200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201122210203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 502805326 + ... + 502805725.
Almost surely, 2201122210200 is an apocalyptic number.
201122210200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201122210200 is an abundant number, since it is smaller than the sum of its proper divisors (266486928980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201122210200 is a wasteful number, since it uses less digits than its factorization.
201122210200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1005611067 (or 1005611058 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 201122210200 its reverse (2012221102), we get a palindrome (203134431302).
The spelling of 201122210200 in words is "two hundred one billion, one hundred twenty-two million, two hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •