Base | Representation |
---|---|
bin | 11001100100001000100011… |
… | …110101001000001000011101 |
3 | 112202002121110112210111212211 |
4 | 121210020203311020020131 |
5 | 104214110323240113224 |
6 | 1035043330024400421 |
7 | 32453051436614536 |
oct | 3144104365101035 |
9 | 482077415714784 |
10 | 112434255004189 |
11 | 32909110881a98 |
12 | 1073a618616111 |
13 | 4a97673c329c1 |
14 | 1da9bc017168d |
15 | ceea16559894 |
hex | 664223d4821d |
112434255004189 has 2 divisors, whose sum is σ = 112434255004190. Its totient is φ = 112434255004188.
The previous prime is 112434255004069. The next prime is 112434255004249. The reversal of 112434255004189 is 981400552434211.
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., 112100090079289 + 334164924900 = 10587733^2 + 578070^2 .
It is a cyclic number.
It is not a de Polignac number, because 112434255004189 - 211 = 112434255002141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112434255004889) 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, 56217127502094 + 56217127502095.
It is an arithmetic number, because the mean of its divisors is an integer number (56217127502095).
Almost surely, 2112434255004189 is an apocalyptic number.
It is an amenable number.
112434255004189 is a deficient number, since it is larger than the sum of its proper divisors (1).
112434255004189 is an equidigital number, since it uses as much as digits as its factorization.
112434255004189 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1382400, while the sum is 49.
The spelling of 112434255004189 in words is "one hundred twelve trillion, four hundred thirty-four billion, two hundred fifty-five million, four thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •