Base | Representation |
---|---|
bin | 11111001010100… |
… | …00011111011101 |
3 | 200012220202211202 |
4 | 33211100133131 |
5 | 1013411100432 |
6 | 41535125245 |
7 | 6323035232 |
oct | 1745203735 |
9 | 605822752 |
10 | 261425117 |
11 | 124627618 |
12 | 73673825 |
13 | 42212b25 |
14 | 26a11789 |
15 | 17e3e462 |
hex | f9507dd |
261425117 has 2 divisors, whose sum is σ = 261425118. Its totient is φ = 261425116.
The previous prime is 261425069. The next prime is 261425147. The reversal of 261425117 is 711524162.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 258116356 + 3308761 = 16066^2 + 1819^2 .
It is a cyclic number.
It is not a de Polignac number, because 261425117 - 214 = 261408733 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 261425117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (261425147) 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, 130712558 + 130712559.
It is an arithmetic number, because the mean of its divisors is an integer number (130712559).
Almost surely, 2261425117 is an apocalyptic number.
It is an amenable number.
261425117 is a deficient number, since it is larger than the sum of its proper divisors (1).
261425117 is an equidigital number, since it uses as much as digits as its factorization.
261425117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3360, while the sum is 29.
The square root of 261425117 is about 16168.6461090593. The cubic root of 261425117 is about 639.4144359221.
Adding to 261425117 its reverse (711524162), we get a palindrome (972949279).
The spelling of 261425117 in words is "two hundred sixty-one million, four hundred twenty-five thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •