Base | Representation |
---|---|
bin | 110100001101001000… |
… | …1110000001100100101 |
3 | 101201101010202122120001 |
4 | 1220122101300030211 |
5 | 3314100130324143 |
6 | 123300322341301 |
7 | 11046122241346 |
oct | 1503221601445 |
9 | 351333678501 |
10 | 112110011173 |
11 | 436001a67a6 |
12 | 198894ba831 |
13 | a7586b1724 |
14 | 55d75180cd |
15 | 2db248b14d |
hex | 1a1a470325 |
112110011173 has 2 divisors, whose sum is σ = 112110011174. Its totient is φ = 112110011172.
The previous prime is 112110011159. The next prime is 112110011207. The reversal of 112110011173 is 371110011211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92402624484 + 19707386689 = 303978^2 + 140383^2 .
It is a cyclic number.
It is not a de Polignac number, because 112110011173 - 213 = 112110002981 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112110011173.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112110014173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56055005586 + 56055005587.
It is an arithmetic number, because the mean of its divisors is an integer number (56055005587).
Almost surely, 2112110011173 is an apocalyptic number.
It is an amenable number.
112110011173 is a deficient number, since it is larger than the sum of its proper divisors (1).
112110011173 is an equidigital number, since it uses as much as digits as its factorization.
112110011173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 19.
Adding to 112110011173 its reverse (371110011211), we get a palindrome (483220022384).
The spelling of 112110011173 in words is "one hundred twelve billion, one hundred ten million, eleven thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •