Base | Representation |
---|---|
bin | 11001000011101000110010… |
… | …001001011000011110100001 |
3 | 112110012010022222122010201121 |
4 | 121003220302021120132201 |
5 | 103421013334210413441 |
6 | 1030213405252132241 |
7 | 32132524202154454 |
oct | 3103506211303641 |
9 | 473163288563647 |
10 | 110201112201121 |
11 | 3212803599a577 |
12 | 10439869607081 |
13 | 4964bc6b539b6 |
14 | 1d2da95a1949b |
15 | cb18b562cdd1 |
hex | 643a322587a1 |
110201112201121 has 16 divisors (see below), whose sum is σ = 111657329501760. Its totient is φ = 108748025305920.
The previous prime is 110201112201109. The next prime is 110201112201149. The reversal of 110201112201121 is 121102211102011.
It is a cyclic number.
It is not a de Polignac number, because 110201112201121 - 29 = 110201112200609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110201112201095 and 110201112201104.
It is not an unprimeable number, because it can be changed into a prime (110201112201151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 256269031 + ... + 256698691.
It is an arithmetic number, because the mean of its divisors is an integer number (6978583093860).
Almost surely, 2110201112201121 is an apocalyptic number.
It is an amenable number.
110201112201121 is a deficient number, since it is larger than the sum of its proper divisors (1456217300639).
110201112201121 is a wasteful number, since it uses less digits than its factorization.
110201112201121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 433296.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 110201112201121 its reverse (121102211102011), we get a palindrome (231303323303132).
The spelling of 110201112201121 in words is "one hundred ten trillion, two hundred one billion, one hundred twelve million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •