Base | Representation |
---|---|
bin | 101101101110101011101100… |
… | …001111111011001110010100 |
3 | 222101002220010201112101212221 |
4 | 231232223230033323032110 |
5 | 202330122432130401322 |
6 | 1551425144402552124 |
7 | 60235306423033666 |
oct | 5556535417731624 |
9 | 871086121471787 |
10 | 201120102200212 |
11 | 590a0613557948 |
12 | 1a68250b368644 |
13 | 882b70c975b80 |
14 | 379439cbb8536 |
15 | 183b8de7479c7 |
hex | b6eaec3fb394 |
201120102200212 has 12 divisors (see below), whose sum is σ = 379034038762036. Its totient is φ = 92824662553920.
The previous prime is 201120102200203. The next prime is 201120102200219. The reversal of 201120102200212 is 212002201021102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 84625942983696 + 116494159216516 = 9199236^2 + 10793246^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201120102200219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1933847136489 + ... + 1933847136592.
Almost surely, 2201120102200212 is an apocalyptic number.
It is an amenable number.
201120102200212 is a deficient number, since it is larger than the sum of its proper divisors (177913936561824).
201120102200212 is a wasteful number, since it uses less digits than its factorization.
201120102200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3867694273098 (or 3867694273096 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201120102200212 its reverse (212002201021102), we get a palindrome (413122303221314).
The spelling of 201120102200212 in words is "two hundred one trillion, one hundred twenty billion, one hundred two million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •