Base | Representation |
---|---|
bin | 110100011011110001… |
… | …1011000110000110011 |
3 | 101202122100222020222102 |
4 | 1220313203120300303 |
5 | 3321101400014133 |
6 | 123421145531015 |
7 | 11064235115222 |
oct | 1506743306063 |
9 | 352570866872 |
10 | 112601173043 |
11 | 438324769a7 |
12 | 199a5aa3a6b |
13 | a806390a58 |
14 | 564284ccb9 |
15 | 2de065a7e8 |
hex | 1a378d8c33 |
112601173043 has 2 divisors, whose sum is σ = 112601173044. Its totient is φ = 112601173042.
The previous prime is 112601173019. The next prime is 112601173067. The reversal of 112601173043 is 340371106211.
It is a balanced prime because it is at equal distance from previous prime (112601173019) and next prime (112601173067).
It is an emirp because it is prime and its reverse (340371106211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112601173043 - 224 = 112584395827 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112601172997 and 112601173015.
It is not a weakly prime, because it can be changed into another prime (112601173343) 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, 56300586521 + 56300586522.
It is an arithmetic number, because the mean of its divisors is an integer number (56300586522).
Almost surely, 2112601173043 is an apocalyptic number.
112601173043 is a deficient number, since it is larger than the sum of its proper divisors (1).
112601173043 is an equidigital number, since it uses as much as digits as its factorization.
112601173043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 29.
Adding to 112601173043 its reverse (340371106211), we get a palindrome (452972279254).
The spelling of 112601173043 in words is "one hundred twelve billion, six hundred one million, one hundred seventy-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •