Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0010110101100100101 |
3 | 101112012202102001221001 |
4 | 1212203010112230211 |
5 | 3301001130311044 |
6 | 122330035353301 |
7 | 10645425433516 |
oct | 1464304265445 |
9 | 345182361831 |
10 | 110110010149 |
11 | 42774259397 |
12 | 1940b752831 |
13 | a4ca236a79 |
14 | 5487a5ca0d |
15 | 2ce6ac82d4 |
hex | 19a3116b25 |
110110010149 has 2 divisors, whose sum is σ = 110110010150. Its totient is φ = 110110010148.
The previous prime is 110110010099. The next prime is 110110010159. The reversal of 110110010149 is 941010011011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69055956225 + 41054053924 = 262785^2 + 202618^2 .
It is a cyclic number.
It is not a de Polignac number, because 110110010149 - 225 = 110076455717 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110110010159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055005074 + 55055005075.
It is an arithmetic number, because the mean of its divisors is an integer number (55055005075).
Almost surely, 2110110010149 is an apocalyptic number.
It is an amenable number.
110110010149 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110010149 is an equidigital number, since it uses as much as digits as its factorization.
110110010149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 19.
The spelling of 110110010149 in words is "one hundred ten billion, one hundred ten million, ten thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •