Base | Representation |
---|---|
bin | 11001000011111011011010… |
… | …101101111000110000111111 |
3 | 112110021000222101020101212201 |
4 | 121003323122231320300333 |
5 | 103421330323233241111 |
6 | 1030230514505212331 |
7 | 32134133052355003 |
oct | 3103733255706077 |
9 | 473230871211781 |
10 | 110221120212031 |
11 | 321355729a0284 |
12 | 104417121910a7 |
13 | 4966a650a49ca |
14 | 1d30a32dc8703 |
15 | cb2186e2c6c1 |
hex | 643edab78c3f |
110221120212031 has 2 divisors, whose sum is σ = 110221120212032. Its totient is φ = 110221120212030.
The previous prime is 110221120211981. The next prime is 110221120212041. The reversal of 110221120212031 is 130212021122011.
It is a strong prime.
It is an emirp because it is prime and its reverse (130212021122011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110221120212031 is a prime.
It is a super-2 number, since 2×1102211202120312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110221120212041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110560106015 + 55110560106016.
It is an arithmetic number, because the mean of its divisors is an integer number (55110560106016).
Almost surely, 2110221120212031 is an apocalyptic number.
110221120212031 is a deficient number, since it is larger than the sum of its proper divisors (1).
110221120212031 is an equidigital number, since it uses as much as digits as its factorization.
110221120212031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 110221120212031 its reverse (130212021122011), we get a palindrome (240433141334042).
The spelling of 110221120212031 in words is "one hundred ten trillion, two hundred twenty-one billion, one hundred twenty million, two hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •