Base | Representation |
---|---|
bin | 1111101000101… |
… | …10011110000101 |
3 | 100010210211020022 |
4 | 13310112132011 |
5 | 232034222122 |
6 | 21003144525 |
7 | 3151606304 |
oct | 764263605 |
9 | 303724208 |
10 | 131164037 |
11 | 68047534 |
12 | 37b15145 |
13 | 21235574 |
14 | 135c443b |
15 | b7ad642 |
hex | 7d16785 |
131164037 has 2 divisors, whose sum is σ = 131164038. Its totient is φ = 131164036.
The previous prime is 131163997. The next prime is 131164039. The reversal of 131164037 is 730461131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 112232836 + 18931201 = 10594^2 + 4351^2 .
It is a cyclic number.
It is not a de Polignac number, because 131164037 - 216 = 131098501 is a prime.
Together with 131164039, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 131163997 and 131164015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131164039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65582018 + 65582019.
It is an arithmetic number, because the mean of its divisors is an integer number (65582019).
Almost surely, 2131164037 is an apocalyptic number.
It is an amenable number.
131164037 is a deficient number, since it is larger than the sum of its proper divisors (1).
131164037 is an equidigital number, since it uses as much as digits as its factorization.
131164037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 26.
The square root of 131164037 is about 11452.6868899835. The cubic root of 131164037 is about 508.0872049953.
The spelling of 131164037 in words is "one hundred thirty-one million, one hundred sixty-four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •