Base | Representation |
---|---|
bin | 1111100010010… |
… | …01101001000001 |
3 | 100002020012100222 |
4 | 13301021221001 |
5 | 231330400212 |
6 | 20533152425 |
7 | 3141513302 |
oct | 761115101 |
9 | 302205328 |
10 | 130325057 |
11 | 67624165 |
12 | 3778b715 |
13 | 21000725 |
14 | 134467a9 |
15 | b694c72 |
hex | 7c49a41 |
130325057 has 2 divisors, whose sum is σ = 130325058. Its totient is φ = 130325056.
The previous prime is 130325053. The next prime is 130325059. The reversal of 130325057 is 750523031.
It is a Cunningham number, because it is equal to 114162+1.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130325056 + 1 = 11416^2 + 1^2 .
It is an emirp because it is prime and its reverse (750523031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130325057 - 22 = 130325053 is a prime.
Together with 130325059, 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 (130325053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65162528 + 65162529.
It is an arithmetic number, because the mean of its divisors is an integer number (65162529).
Almost surely, 2130325057 is an apocalyptic number.
It is an amenable number.
130325057 is a deficient number, since it is larger than the sum of its proper divisors (1).
130325057 is an equidigital number, since it uses as much as digits as its factorization.
130325057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3150, while the sum is 26.
The square root of 130325057 is about 11416.0000437982. Note that the first 4 decimals coincide. The cubic root of 130325057 is about 507.0015742734.
Adding to 130325057 its reverse (750523031), we get a palindrome (880848088).
The spelling of 130325057 in words is "one hundred thirty million, three hundred twenty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •