Base | Representation |
---|---|
bin | 11001000110101100010110… |
… | …100001101101000010000111 |
3 | 112110221012100112212222011111 |
4 | 121012230112201231002013 |
5 | 103432433414131242411 |
6 | 1030454054330545451 |
7 | 32153640016621342 |
oct | 3106542641550207 |
9 | 473835315788144 |
10 | 110411102212231 |
11 | 321a90a38729a7 |
12 | 104724b2898287 |
13 | 497b950a73842 |
14 | 1d39cd67bd459 |
15 | cb70a5b3a721 |
hex | 646b1686d087 |
110411102212231 has 16 divisors (see below), whose sum is σ = 118423977890400. Its totient is φ = 102618699475968.
The previous prime is 110411102212211. The next prime is 110411102212237. The reversal of 110411102212231 is 132212201114011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110411102212231 is a prime.
It is a super-4 number, since 4×1104111022122314 (a number of 57 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110411102212237) 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, 9319855 + ... + 17540863.
It is an arithmetic number, because the mean of its divisors is an integer number (7401498618150).
Almost surely, 2110411102212231 is an apocalyptic number.
110411102212231 is a deficient number, since it is larger than the sum of its proper divisors (8012875678169).
110411102212231 is a wasteful number, since it uses less digits than its factorization.
110411102212231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8234418.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 110411102212231 its reverse (132212201114011), we get a palindrome (242623303326242).
The spelling of 110411102212231 in words is "one hundred ten trillion, four hundred eleven billion, one hundred two million, two hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •