Base | Representation |
---|---|
bin | 110011100001111101… |
… | …0010001011001111001 |
3 | 101120122011020000201002 |
4 | 1213003322101121321 |
5 | 3303113204441121 |
6 | 122500441334345 |
7 | 10665166052234 |
oct | 1470372213171 |
9 | 346564200632 |
10 | 110661015161 |
11 | 42a27292634 |
12 | 195441973b5 |
13 | a587439838 |
14 | 54dacd041b |
15 | 2d2a168e0b |
hex | 19c3e91679 |
110661015161 has 2 divisors, whose sum is σ = 110661015162. Its totient is φ = 110661015160.
The previous prime is 110661015151. The next prime is 110661015167. The reversal of 110661015161 is 161510166011.
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., 98623633936 + 12037381225 = 314044^2 + 109715^2 .
It is an emirp because it is prime and its reverse (161510166011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110661015161 - 210 = 110661014137 is a prime.
It is not a weakly prime, because it can be changed into another prime (110661015167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55330507580 + 55330507581.
It is an arithmetic number, because the mean of its divisors is an integer number (55330507581).
Almost surely, 2110661015161 is an apocalyptic number.
It is an amenable number.
110661015161 is a deficient number, since it is larger than the sum of its proper divisors (1).
110661015161 is an equidigital number, since it uses as much as digits as its factorization.
110661015161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 29.
The spelling of 110661015161 in words is "one hundred ten billion, six hundred sixty-one million, fifteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •