Base | Representation |
---|---|
bin | 110000010000001111001111… |
… | …100110010110100011001000 |
3 | 1000211102020100212121211201122 |
4 | 300100033033212112203020 |
5 | 210304021341133001300 |
6 | 2031205254202334412 |
7 | 62462353526225111 |
oct | 6020171746264310 |
9 | 1024366325554648 |
10 | 212222112000200 |
11 | 6169098a672385 |
12 | 1b976097aba408 |
13 | 91555c80a5503 |
14 | 3a5986829b208 |
15 | 19805b67d7c85 |
hex | c103cf9968c8 |
212222112000200 has 48 divisors (see below), whose sum is σ = 493444417030080. Its totient is φ = 84884026455360.
The previous prime is 212222112000191. The next prime is 212222112000203. The reversal of 212222112000200 is 2000211222212.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (212222112000203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26581244 + ... + 33630443.
It is an arithmetic number, because the mean of its divisors is an integer number (10280092021460).
Almost surely, 2212222112000200 is an apocalyptic number.
212222112000200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212222112000200 is an abundant number, since it is smaller than the sum of its proper divisors (281222305029880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212222112000200 is a wasteful number, since it uses less digits than its factorization.
212222112000200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60229326 (or 60229317 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 212222112000200 its reverse (2000211222212), we get a palindrome (214222323222412).
The spelling of 212222112000200 in words is "two hundred twelve trillion, two hundred twenty-two billion, one hundred twelve million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •