Base | Representation |
---|---|
bin | 110000001111111011100101… |
… | …111001001110011111011000 |
3 | 1000211100012220022202122110220 |
4 | 300033323211321032133120 |
5 | 210303200132332211300 |
6 | 2031151444311240040 |
7 | 62461005606404655 |
oct | 6017734571163730 |
9 | 1024305808678426 |
10 | 212201011210200 |
11 | 61682a41839561 |
12 | 1b971b89379020 |
13 | 915361463145c |
14 | 3a58825b0cc2c |
15 | 197ec7e0cbda0 |
hex | c0fee5e4e7d8 |
212201011210200 has 48 divisors (see below), whose sum is σ = 657823134753480. Its totient is φ = 56586936322560.
The previous prime is 212201011210189. The next prime is 212201011210247. The reversal of 212201011210200 is 2012110102212.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 212201011210200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 176834175409 + ... + 176834176608.
Almost surely, 2212201011210200 is an apocalyptic number.
212201011210200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212201011210200 is an abundant number, since it is smaller than the sum of its proper divisors (445622123543280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212201011210200 is a wasteful number, since it uses less digits than its factorization.
212201011210200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 353668352036 (or 353668352027 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 212201011210200 its reverse (2012110102212), we get a palindrome (214213121312412).
The spelling of 212201011210200 in words is "two hundred twelve trillion, two hundred one billion, eleven million, two hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •