Base | Representation |
---|---|
bin | 101101100001011101000111… |
… | …100011111010100001010000 |
3 | 222020212222211212121001120211 |
4 | 231201131013203322201100 |
5 | 202220224313340200422 |
6 | 1545451413214413504 |
7 | 60112526504131054 |
oct | 5541350743724120 |
9 | 866788755531524 |
10 | 200211101100112 |
11 | 58880062095353 |
12 | 1a556304801294 |
13 | 8793a97442b3b |
14 | 37623aa1b1c64 |
15 | 1822e3bdc3577 |
hex | b617478fa850 |
200211101100112 has 10 divisors (see below), whose sum is σ = 387909008381498. Its totient is φ = 100105550550048.
The previous prime is 200211101100083. The next prime is 200211101100163. The reversal of 200211101100112 is 211001101112002.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 121519227827776 + 78691873272336 = 11023576^2 + 8870844^2 .
It is a junction number, because it is equal to n+sod(n) for n = 200211101100092 and 200211101100101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6256596909363 + ... + 6256596909394.
Almost surely, 2200211101100112 is an apocalyptic number.
It is an amenable number.
200211101100112 is a deficient number, since it is larger than the sum of its proper divisors (187697907281386).
200211101100112 is a wasteful number, since it uses less digits than its factorization.
200211101100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12513193818765 (or 12513193818759 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 200211101100112 its reverse (211001101112002), we get a palindrome (411212202212114).
The spelling of 200211101100112 in words is "two hundred trillion, two hundred eleven billion, one hundred one million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •