Base | Representation |
---|---|
bin | 1111101001011… |
… | …11101001011001 |
3 | 100011000001200201 |
4 | 13310233221121 |
5 | 232101022121 |
6 | 21005302201 |
7 | 3152516044 |
oct | 764575131 |
9 | 304001621 |
10 | 131267161 |
11 | 68107a63 |
12 | 37b64961 |
13 | 2127049c |
14 | 1360dc5b |
15 | b7cde91 |
hex | 7d2fa59 |
131267161 has 2 divisors, whose sum is σ = 131267162. Its totient is φ = 131267160.
The previous prime is 131267159. The next prime is 131267179. The reversal of 131267161 is 161762131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131239936 + 27225 = 11456^2 + 165^2 .
It is a cyclic number.
It is not a de Polignac number, because 131267161 - 21 = 131267159 is a prime.
Together with 131267159, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (131267131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65633580 + 65633581.
It is an arithmetic number, because the mean of its divisors is an integer number (65633581).
Almost surely, 2131267161 is an apocalyptic number.
It is an amenable number.
131267161 is a deficient number, since it is larger than the sum of its proper divisors (1).
131267161 is an equidigital number, since it uses as much as digits as its factorization.
131267161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1512, while the sum is 28.
The square root of 131267161 is about 11457.1881803521. The cubic root of 131267161 is about 508.2203264934.
The spelling of 131267161 in words is "one hundred thirty-one million, two hundred sixty-seven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •