Base | Representation |
---|---|
bin | 11001000010010101111110… |
… | …100101000011110111011011 |
3 | 112102212121211120001002211221 |
4 | 121002111332211003313123 |
5 | 103413034241223240211 |
6 | 1030104502455432511 |
7 | 32123225653551211 |
oct | 3102257645036733 |
9 | 472777746032757 |
10 | 110112200211931 |
11 | 320a335a445075 |
12 | 10424595085737 |
13 | 49596c75752c8 |
14 | 1d2965d418cb1 |
15 | cae40ea69c71 |
hex | 64257e943ddb |
110112200211931 has 2 divisors, whose sum is σ = 110112200211932. Its totient is φ = 110112200211930.
The previous prime is 110112200211901. The next prime is 110112200212019. The reversal of 110112200211931 is 139112002211011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110112200211931 is a prime.
It is a super-2 number, since 2×1101122002119312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110112200211896 and 110112200211905.
It is not a weakly prime, because it can be changed into another prime (110112200211901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55056100105965 + 55056100105966.
It is an arithmetic number, because the mean of its divisors is an integer number (55056100105966).
Almost surely, 2110112200211931 is an apocalyptic number.
110112200211931 is a deficient number, since it is larger than the sum of its proper divisors (1).
110112200211931 is an equidigital number, since it uses as much as digits as its factorization.
110112200211931 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 25.
Adding to 110112200211931 its reverse (139112002211011), we get a palindrome (249224202422942).
The spelling of 110112200211931 in words is "one hundred ten trillion, one hundred twelve billion, two hundred million, two hundred eleven thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •