Base | Representation |
---|---|
bin | 11111000000100… |
… | …11001000111001 |
3 | 200010110201202012 |
4 | 33200103020321 |
5 | 1013043001431 |
6 | 41451215305 |
7 | 6306012425 |
oct | 1740231071 |
9 | 603421665 |
10 | 260125241 |
11 | 123919a42 |
12 | 73147535 |
13 | 41b7927c |
14 | 26793b85 |
15 | 17c8422b |
hex | f813239 |
260125241 has 2 divisors, whose sum is σ = 260125242. Its totient is φ = 260125240.
The previous prime is 260125199. The next prime is 260125249. The reversal of 260125241 is 142521062.
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., 130074025 + 130051216 = 11405^2 + 11404^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-260125241 is a prime.
It is a super-3 number, since 3×2601252413 (a number of 26 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (260125249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130062620 + 130062621.
It is an arithmetic number, because the mean of its divisors is an integer number (130062621).
Almost surely, 2260125241 is an apocalyptic number.
260125241 is the 11405-th centered square number.
It is an amenable number.
260125241 is a deficient number, since it is larger than the sum of its proper divisors (1).
260125241 is an equidigital number, since it uses as much as digits as its factorization.
260125241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 260125241 is about 16128.3985875846. The cubic root of 260125241 is about 638.3528943613.
The spelling of 260125241 in words is "two hundred sixty million, one hundred twenty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •