Base | Representation |
---|---|
bin | 1111001000110100011… |
… | …0101011111000010001 |
3 | 220212021101220000201222 |
4 | 3302031012223320101 |
5 | 13230103214042214 |
6 | 315250011334425 |
7 | 24534443144366 |
oct | 3621506537021 |
9 | 825241800658 |
10 | 260065377809 |
11 | a0325142606 |
12 | 4249b451415 |
13 | 1b6a748a053 |
14 | c83151246d |
15 | 6b717dd38e |
hex | 3c8d1abe11 |
260065377809 has 2 divisors, whose sum is σ = 260065377810. Its totient is φ = 260065377808.
The previous prime is 260065377769. The next prime is 260065377823. The reversal of 260065377809 is 908773560062.
260065377809 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 258170691025 + 1894686784 = 508105^2 + 43528^2 .
It is a cyclic number.
It is not a de Polignac number, because 260065377809 - 236 = 191345901073 is a prime.
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 (260065377829) 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, 130032688904 + 130032688905.
It is an arithmetic number, because the mean of its divisors is an integer number (130032688905).
Almost surely, 2260065377809 is an apocalyptic number.
It is an amenable number.
260065377809 is a deficient number, since it is larger than the sum of its proper divisors (1).
260065377809 is an equidigital number, since it uses as much as digits as its factorization.
260065377809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3810240, while the sum is 53.
The spelling of 260065377809 in words is "two hundred sixty billion, sixty-five million, three hundred seventy-seven thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •