Base | Representation |
---|---|
bin | 110100011001011111… |
… | …1000100110001110001 |
3 | 101202110000210011020211 |
4 | 1220302333010301301 |
5 | 3320422240421022 |
6 | 123405411304121 |
7 | 11062314565234 |
oct | 1506277046161 |
9 | 352400704224 |
10 | 112524545137 |
11 | 437a3199254 |
12 | 199842ab041 |
13 | a7c35414b4 |
14 | 56365c341b |
15 | 2dd8a70e77 |
hex | 1a32fc4c71 |
112524545137 has 2 divisors, whose sum is σ = 112524545138. Its totient is φ = 112524545136.
The previous prime is 112524545117. The next prime is 112524545153. The reversal of 112524545137 is 731545425211.
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., 112369766656 + 154778481 = 335216^2 + 12441^2 .
It is an emirp because it is prime and its reverse (731545425211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112524545137 - 27 = 112524545009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112524545137.
It is not a weakly prime, because it can be changed into another prime (112524545117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56262272568 + 56262272569.
It is an arithmetic number, because the mean of its divisors is an integer number (56262272569).
Almost surely, 2112524545137 is an apocalyptic number.
It is an amenable number.
112524545137 is a deficient number, since it is larger than the sum of its proper divisors (1).
112524545137 is an equidigital number, since it uses as much as digits as its factorization.
112524545137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 168000, while the sum is 40.
The spelling of 112524545137 in words is "one hundred twelve billion, five hundred twenty-four million, five hundred forty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •