Base | Representation |
---|---|
bin | 1010000111010001101000… |
… | …1101100110001010101001 |
3 | 1110101001221121000000012122 |
4 | 2201310122031212022221 |
5 | 2424142441141214121 |
6 | 35352301423521025 |
7 | 2225254460201345 |
oct | 241643215461251 |
9 | 43331847000178 |
10 | 11120110101161 |
11 | 35a8015284726 |
12 | 12b719a459175 |
13 | 62881137a829 |
14 | 2a630537c625 |
15 | 1443d615c5ab |
hex | a1d1a3662a9 |
11120110101161 has 2 divisors, whose sum is σ = 11120110101162. Its totient is φ = 11120110101160.
The previous prime is 11120110101109. The next prime is 11120110101179. The reversal of 11120110101161 is 16110101102111.
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., 9249353625625 + 1870756475536 = 3041275^2 + 1367756^2 .
It is a cyclic number.
It is not a de Polignac number, because 11120110101161 - 214 = 11120110084777 is a prime.
It is a super-3 number, since 3×111201101011613 (a number of 40 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (11120110101101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560055050580 + 5560055050581.
It is an arithmetic number, because the mean of its divisors is an integer number (5560055050581).
Almost surely, 211120110101161 is an apocalyptic number.
It is an amenable number.
11120110101161 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120110101161 is an equidigital number, since it uses as much as digits as its factorization.
11120110101161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 17.
Adding to 11120110101161 its reverse (16110101102111), we get a palindrome (27230211203272).
The spelling of 11120110101161 in words is "eleven trillion, one hundred twenty billion, one hundred ten million, one hundred one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •