Base | Representation |
---|---|
bin | 1111100111001… |
… | …10100111101001 |
3 | 100010102212101012 |
4 | 13303212213221 |
5 | 232011434131 |
6 | 20555033305 |
7 | 3150132011 |
oct | 763464751 |
9 | 303385335 |
10 | 130968041 |
11 | 67a23256 |
12 | 37a3b835 |
13 | 211972a9 |
14 | 13572c41 |
15 | b77052b |
hex | 7ce69e9 |
130968041 has 2 divisors, whose sum is σ = 130968042. Its totient is φ = 130968040.
The previous prime is 130968011. The next prime is 130968043. The reversal of 130968041 is 140869031.
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., 121992025 + 8976016 = 11045^2 + 2996^2 .
It is a cyclic number.
It is not a de Polignac number, because 130968041 - 210 = 130967017 is a prime.
It is a Sophie Germain prime.
Together with 130968043, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 130967989 and 130968007.
It is not a weakly prime, because it can be changed into another prime (130968043) 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, 65484020 + 65484021.
It is an arithmetic number, because the mean of its divisors is an integer number (65484021).
Almost surely, 2130968041 is an apocalyptic number.
It is an amenable number.
130968041 is a deficient number, since it is larger than the sum of its proper divisors (1).
130968041 is an equidigital number, since it uses as much as digits as its factorization.
130968041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The square root of 130968041 is about 11444.1269217009. The cubic root of 130968041 is about 507.8340037240.
The spelling of 130968041 in words is "one hundred thirty million, nine hundred sixty-eight thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •