Base | Representation |
---|---|
bin | 110100001110101001… |
… | …1011000110000111011 |
3 | 101201111200021112010111 |
4 | 1220131103120300323 |
5 | 3314201124134011 |
6 | 123305334325151 |
7 | 11050306552513 |
oct | 1503523306073 |
9 | 351450245114 |
10 | 112160771131 |
11 | 43626916482 |
12 | 198a24b97b7 |
13 | a7660749c6 |
14 | 560016c843 |
15 | 2db6b66121 |
hex | 1a1d4d8c3b |
112160771131 has 2 divisors, whose sum is σ = 112160771132. Its totient is φ = 112160771130.
The previous prime is 112160771119. The next prime is 112160771153. The reversal of 112160771131 is 131177061211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112160771131 - 223 = 112152382523 is a prime.
It is a super-2 number, since 2×1121607711312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112160771093 and 112160771102.
It is not a weakly prime, because it can be changed into another prime (112160772131) 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, 56080385565 + 56080385566.
It is an arithmetic number, because the mean of its divisors is an integer number (56080385566).
Almost surely, 2112160771131 is an apocalyptic number.
112160771131 is a deficient number, since it is larger than the sum of its proper divisors (1).
112160771131 is an equidigital number, since it uses as much as digits as its factorization.
112160771131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1764, while the sum is 31.
The spelling of 112160771131 in words is "one hundred twelve billion, one hundred sixty million, seven hundred seventy-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •