Base | Representation |
---|---|
bin | 100111010111011… |
… | …101001100000001 |
3 | 1201000202212012012 |
4 | 213113131030001 |
5 | 2323034212124 |
6 | 145311542305 |
7 | 22236551126 |
oct | 4727351401 |
9 | 1630685165 |
10 | 660460289 |
11 | 3098a3655 |
12 | 16522a995 |
13 | a6aa7208 |
14 | 63a0474d |
15 | 3ceb1e0e |
hex | 275dd301 |
660460289 has 2 divisors, whose sum is σ = 660460290. Its totient is φ = 660460288.
The previous prime is 660460279. The next prime is 660460291. The reversal of 660460289 is 982064066.
660460289 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., 336172225 + 324288064 = 18335^2 + 18008^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-660460289 is a prime.
Together with 660460291, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p34308896 and since 660460289 and 34308896 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (660460279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 330230144 + 330230145.
It is an arithmetic number, because the mean of its divisors is an integer number (330230145).
Almost surely, 2660460289 is an apocalyptic number.
It is an amenable number.
660460289 is a deficient number, since it is larger than the sum of its proper divisors (1).
660460289 is an equidigital number, since it uses as much as digits as its factorization.
660460289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 124416, while the sum is 41.
The square root of 660460289 is about 25699.4219584799. The cubic root of 660460289 is about 870.8611234240.
The spelling of 660460289 in words is "six hundred sixty million, four hundred sixty thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •