Base | Representation |
---|---|
bin | 1101011010100… |
… | …00111011110101 |
3 | 21211202001221222 |
4 | 12231100323311 |
5 | 212301413031 |
6 | 15055520125 |
7 | 2534324204 |
oct | 655207365 |
9 | 254661858 |
10 | 112529141 |
11 | 5857989a |
12 | 31829045 |
13 | 1a40c5ba |
14 | 10d3323b |
15 | 9d2be7b |
hex | 6b50ef5 |
112529141 has 2 divisors, whose sum is σ = 112529142. Its totient is φ = 112529140.
The previous prime is 112529119. The next prime is 112529143. The reversal of 112529141 is 141925211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111218116 + 1311025 = 10546^2 + 1145^2 .
It is an emirp because it is prime and its reverse (141925211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112529141 is a prime.
It is a Sophie Germain prime.
Together with 112529143, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 112529141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112529143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56264570 + 56264571.
It is an arithmetic number, because the mean of its divisors is an integer number (56264571).
Almost surely, 2112529141 is an apocalyptic number.
It is an amenable number.
112529141 is a deficient number, since it is larger than the sum of its proper divisors (1).
112529141 is an equidigital number, since it uses as much as digits as its factorization.
112529141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 720, while the sum is 26.
The square root of 112529141 is about 10607.9753487647. The cubic root of 112529141 is about 482.7863706690.
The spelling of 112529141 in words is "one hundred twelve million, five hundred twenty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •