Base | Representation |
---|---|
bin | 11110111010011… |
… | …11110011010101 |
3 | 200001222002012212 |
4 | 33131033303111 |
5 | 1012341401031 |
6 | 41422123205 |
7 | 6266140655 |
oct | 1735176325 |
9 | 601862185 |
10 | 259325141 |
11 | 1234228a9 |
12 | 72a20505 |
13 | 4195903a |
14 | 26626365 |
15 | 17b7712b |
hex | f74fcd5 |
259325141 has 2 divisors, whose sum is σ = 259325142. Its totient is φ = 259325140.
The previous prime is 259325083. The next prime is 259325147. The reversal of 259325141 is 141523952.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 160402225 + 98922916 = 12665^2 + 9946^2 .
It is a cyclic number.
It is not a de Polignac number, because 259325141 - 214 = 259308757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 259325098 and 259325107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (259325147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 129662570 + 129662571.
It is an arithmetic number, because the mean of its divisors is an integer number (129662571).
Almost surely, 2259325141 is an apocalyptic number.
It is an amenable number.
259325141 is a deficient number, since it is larger than the sum of its proper divisors (1).
259325141 is an equidigital number, since it uses as much as digits as its factorization.
259325141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10800, while the sum is 32.
The square root of 259325141 is about 16103.5754104485. The cubic root of 259325141 is about 637.6977346891.
The spelling of 259325141 in words is "two hundred fifty-nine million, three hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •