Base | Representation |
---|---|
bin | 101111110001100010001111… |
… | …000111000101110101100001 |
3 | 1000112221112022120001211022100 |
4 | 233301202033013011311201 |
5 | 210014434241441333441 |
6 | 2022512113534001013 |
7 | 62154051133531245 |
oct | 5761421707056541 |
9 | 1015845276054270 |
10 | 210112201121121 |
11 | 60a480a1a12342 |
12 | 1b69519b046169 |
13 | 9031659949020 |
14 | 39c56b03c6425 |
15 | 1945779468cb6 |
hex | bf188f1c5d61 |
210112201121121 has 96 divisors (see below), whose sum is σ = 342948051031040. Its totient is φ = 123065828236800.
The previous prime is 210112201121101. The next prime is 210112201121177. The reversal of 210112201121121 is 121121102211012.
It is a happy number.
210112201121121 is a `hidden beast` number, since 210 + 1 + 1 + 220 + 1 + 1 + 211 + 21 = 666.
It is a de Polignac number, because none of the positive numbers 2k-210112201121121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210112201121094 and 210112201121103.
It is not an unprimeable number, because it can be changed into a prime (210112201121101) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2679040710 + ... + 2679119136.
Almost surely, 2210112201121121 is an apocalyptic number.
It is an amenable number.
210112201121121 is a deficient number, since it is larger than the sum of its proper divisors (132835849909919).
210112201121121 is a wasteful number, since it uses less digits than its factorization.
210112201121121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90647 (or 90644 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 210112201121121 its reverse (121121102211012), we get a palindrome (331233303332133).
The spelling of 210112201121121 in words is "two hundred ten trillion, one hundred twelve billion, two hundred one million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •