Base | Representation |
---|---|
bin | 111011001110000101110001… |
… | …110010001011001010110001 |
3 | 1021011012001202211112101120011 |
4 | 323032011301302023022301 |
5 | 233114230241304300324 |
6 | 2321534244351214521 |
7 | 105601052440440412 |
oct | 7316056162131261 |
9 | 1234161684471504 |
10 | 260453020775089 |
11 | 75a9656225a93a |
12 | 25265659817441 |
13 | b2437cacc4aac |
14 | 4845dca103809 |
15 | 2019eaa1c9c94 |
hex | ece171c8b2b1 |
260453020775089 has 2 divisors, whose sum is σ = 260453020775090. Its totient is φ = 260453020775088.
The previous prime is 260453020774987. The next prime is 260453020775141. The reversal of 260453020775089 is 980577020354062.
It is a happy number.
260453020775089 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., 178614003269025 + 81839017506064 = 13364655^2 + 9046492^2 .
It is a cyclic number.
It is not a de Polignac number, because 260453020775089 - 211 = 260453020773041 is a prime.
It is not a weakly prime, because it can be changed into another prime (260453020775989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 130226510387544 + 130226510387545.
It is an arithmetic number, because the mean of its divisors is an integer number (130226510387545).
Almost surely, 2260453020775089 is an apocalyptic number.
It is an amenable number.
260453020775089 is a deficient number, since it is larger than the sum of its proper divisors (1).
260453020775089 is an equidigital number, since it uses as much as digits as its factorization.
260453020775089 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25401600, while the sum is 58.
The spelling of 260453020775089 in words is "two hundred sixty trillion, four hundred fifty-three billion, twenty million, seven hundred seventy-five thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •