Base | Representation |
---|---|
bin | 101101011111111111001001… |
… | …011001100100101010011001 |
3 | 222020112100101220202212100020 |
4 | 231133333021121210222121 |
5 | 202212101142223241441 |
6 | 1545333205030301053 |
7 | 60102325210545003 |
oct | 5537771131445231 |
9 | 866470356685306 |
10 | 200110200212121 |
11 | 58841294180821 |
12 | 1a53a8451b7789 |
13 | 87874070b87a4 |
14 | 375b557643373 |
15 | 18204d3a33e66 |
hex | b5ffc9664a99 |
200110200212121 has 8 divisors (see below), whose sum is σ = 266814687511680. Its totient is φ = 133406256526992.
The previous prime is 200110200212101. The next prime is 200110200212171. The reversal of 200110200212121 is 121212002011002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200110200212121 - 25 = 200110200212089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200110200212121.
It is not an unprimeable number, because it can be changed into a prime (200110200212101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135043905 + ... + 136517678.
It is an arithmetic number, because the mean of its divisors is an integer number (33351835938960).
Almost surely, 2200110200212121 is an apocalyptic number.
It is an amenable number.
200110200212121 is a deficient number, since it is larger than the sum of its proper divisors (66704487299559).
200110200212121 is a wasteful number, since it uses less digits than its factorization.
200110200212121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271807215.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200110200212121 its reverse (121212002011002), we get a palindrome (321322202223123).
The spelling of 200110200212121 in words is "two hundred trillion, one hundred ten billion, two hundred million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •