Base | Representation |
---|---|
bin | 1101011010101… |
… | …00110110001001 |
3 | 21211202212221022 |
4 | 12231110312021 |
5 | 212302421121 |
6 | 15100122225 |
7 | 2534422001 |
oct | 655246611 |
9 | 254685838 |
10 | 112545161 |
11 | 5858a933 |
12 | 31836375 |
13 | 1a416991 |
14 | 10d39001 |
15 | 9d31aab |
hex | 6b54d89 |
112545161 has 2 divisors, whose sum is σ = 112545162. Its totient is φ = 112545160.
The previous prime is 112545149. The next prime is 112545163. The reversal of 112545161 is 161545211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99900025 + 12645136 = 9995^2 + 3556^2 .
It is an emirp because it is prime and its reverse (161545211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112545161 - 222 = 108350857 is a prime.
Together with 112545163, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112545161.
It is not a weakly prime, because it can be changed into another prime (112545163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56272580 + 56272581.
It is an arithmetic number, because the mean of its divisors is an integer number (56272581).
Almost surely, 2112545161 is an apocalyptic number.
It is an amenable number.
112545161 is a deficient number, since it is larger than the sum of its proper divisors (1).
112545161 is an equidigital number, since it uses as much as digits as its factorization.
112545161 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1200, while the sum is 26.
The square root of 112545161 is about 10608.7304141448. The cubic root of 112545161 is about 482.8092799072.
Subtracting 112545161 from its reverse (161545211), we obtain a triangular number (49000050 = T9899).
The spelling of 112545161 in words is "one hundred twelve million, five hundred forty-five thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •