Base | Representation |
---|---|
bin | 101101100001011101001110… |
… | …101010010010001000011000 |
3 | 222020220000011011201110220120 |
4 | 231201131032222102020120 |
5 | 202220230034333211300 |
6 | 1545451433111353240 |
7 | 60112532451424563 |
oct | 5541351652221030 |
9 | 866800134643816 |
10 | 200211220210200 |
11 | 58880113349541 |
12 | 1a556338682820 |
13 | 8793ab6017994 |
14 | 37623bbd394da |
15 | 1822e475a03a0 |
hex | b6174ea92218 |
200211220210200 has 96 divisors (see below), whose sum is σ = 657163887546960. Its totient is φ = 50249090560000.
The previous prime is 200211220210189. The next prime is 200211220210213. The reversal of 200211220210200 is 2012022112002.
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 200211220210200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9814265301 + ... + 9814285700.
Almost surely, 2200211220210200 is an apocalyptic number.
200211220210200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200211220210200 is an abundant number, since it is smaller than the sum of its proper divisors (456952667336760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200211220210200 is a wasteful number, since it uses less digits than its factorization.
200211220210200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19628551037 (or 19628551028 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200211220210200 its reverse (2012022112002), we get a palindrome (202223242322202).
The spelling of 200211220210200 in words is "two hundred trillion, two hundred eleven billion, two hundred twenty million, two hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •