Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0011001100111110011 |
3 | 101112012202102200100211 |
4 | 1212203010121213303 |
5 | 3301001131202011 |
6 | 122330035524551 |
7 | 10645425513454 |
oct | 1464304314763 |
9 | 345182380324 |
10 | 110110022131 |
11 | 4277426739a |
12 | 1940b759757 |
13 | a4ca23c365 |
14 | 5487a6312b |
15 | 2ce6acbb21 |
hex | 19a31199f3 |
110110022131 has 2 divisors, whose sum is σ = 110110022132. Its totient is φ = 110110022130.
The previous prime is 110110022117. The next prime is 110110022149. The reversal of 110110022131 is 131220011011.
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-110110022131 is a prime.
It is a super-2 number, since 2×1101100221312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110110022161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055011065 + 55055011066.
It is an arithmetic number, because the mean of its divisors is an integer number (55055011066).
Almost surely, 2110110022131 is an apocalyptic number.
110110022131 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110022131 is an equidigital number, since it uses as much as digits as its factorization.
110110022131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110110022131 its reverse (131220011011), we get a palindrome (241330033142).
The spelling of 110110022131 in words is "one hundred ten billion, one hundred ten million, twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •