Base | Representation |
---|---|
bin | 1111100100110… |
… | …00000000101001 |
3 | 100002211111200212 |
4 | 13302120000221 |
5 | 231421133212 |
6 | 20544110505 |
7 | 3144321203 |
oct | 762300051 |
9 | 302744625 |
10 | 130646057 |
11 | 67823353 |
12 | 37905435 |
13 | 210b3879 |
14 | 134cb773 |
15 | b709e22 |
hex | 7c98029 |
130646057 has 2 divisors, whose sum is σ = 130646058. Its totient is φ = 130646056.
The previous prime is 130646053. The next prime is 130646069. The reversal of 130646057 is 750646031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 128618281 + 2027776 = 11341^2 + 1424^2 .
It is a cyclic number.
It is not a de Polignac number, because 130646057 - 22 = 130646053 is a prime.
It is equal to p7412657 and since 130646057 and 7412657 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (130646051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65323028 + 65323029.
It is an arithmetic number, because the mean of its divisors is an integer number (65323029).
Almost surely, 2130646057 is an apocalyptic number.
It is an amenable number.
130646057 is a deficient number, since it is larger than the sum of its proper divisors (1).
130646057 is an equidigital number, since it uses as much as digits as its factorization.
130646057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 32.
The square root of 130646057 is about 11430.0506123114. The cubic root of 130646057 is about 507.4174934426.
The spelling of 130646057 in words is "one hundred thirty million, six hundred forty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •