Base | Representation |
---|---|
bin | 101101101110100011010100… |
… | …010110000001010011011000 |
3 | 222101002000221010101210020212 |
4 | 231232203110112001103120 |
5 | 202330001023432211300 |
6 | 1551421100302510252 |
7 | 60234540546630062 |
oct | 5556432426012330 |
9 | 871060833353225 |
10 | 201111111210200 |
11 | 5909781a35aa94 |
12 | 1a680820295388 |
13 | 882a90902b939 |
14 | 3793b88a6a732 |
15 | 183b56524a935 |
hex | b6e8d45814d8 |
201111111210200 has 48 divisors (see below), whose sum is σ = 483706896804000. Its totient is φ = 77670498120320.
The previous prime is 201111111210173. The next prime is 201111111210203. The reversal of 201111111210200 is 2012111111102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201111111210203) 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, 17337158960 + ... + 17337170559.
It is an arithmetic number, because the mean of its divisors is an integer number (10077227016750).
Almost surely, 2201111111210200 is an apocalyptic number.
201111111210200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201111111210200 is an abundant number, since it is smaller than the sum of its proper divisors (282595785593800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201111111210200 is a wasteful number, since it uses less digits than its factorization.
201111111210200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34674329564 (or 34674329555 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 201111111210200 its reverse (2012111111102), we get a palindrome (203123222321302).
The spelling of 201111111210200 in words is "two hundred one trillion, one hundred eleven billion, one hundred eleven million, two hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •