Base | Representation |
---|---|
bin | 1101011011000… |
… | …10011111011101 |
3 | 21211212201121101 |
4 | 12231202133131 |
5 | 212311213203 |
6 | 15101233101 |
7 | 2535043645 |
oct | 655423735 |
9 | 254781541 |
10 | 112601053 |
11 | 58618924 |
12 | 31862791 |
13 | 1a436256 |
14 | 10d51525 |
15 | 9d4341d |
hex | 6b627dd |
112601053 has 2 divisors, whose sum is σ = 112601054. Its totient is φ = 112601052.
The previous prime is 112601051. The next prime is 112601089. The reversal of 112601053 is 350106211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86825124 + 25775929 = 9318^2 + 5077^2 .
It is a cyclic number.
It is not a de Polignac number, because 112601053 - 21 = 112601051 is a prime.
Together with 112601051, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 112601053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112601051) 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, 56300526 + 56300527.
It is an arithmetic number, because the mean of its divisors is an integer number (56300527).
Almost surely, 2112601053 is an apocalyptic number.
It is an amenable number.
112601053 is a deficient number, since it is larger than the sum of its proper divisors (1).
112601053 is an equidigital number, since it uses as much as digits as its factorization.
112601053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 112601053 is about 10611.3643326389. The cubic root of 112601053 is about 482.8891906741.
Adding to 112601053 its reverse (350106211), we get a palindrome (462707264).
The spelling of 112601053 in words is "one hundred twelve million, six hundred one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •