Base | Representation |
---|---|
bin | 10011001101011100100… |
… | …11010001101100100001 |
3 | 2100002201022120211101022 |
4 | 21212232103101230201 |
5 | 41303242344110324 |
6 | 1223120314015225 |
7 | 65454521565203 |
oct | 11465623215441 |
9 | 2302638524338 |
10 | 660054285089 |
11 | 234a22488871 |
12 | a7b0aa17515 |
13 | 4a320713344 |
14 | 23d38028773 |
15 | 1228224505e |
hex | 99ae4d1b21 |
660054285089 has 2 divisors, whose sum is σ = 660054285090. Its totient is φ = 660054285088.
The previous prime is 660054285013. The next prime is 660054285091. The reversal of 660054285089 is 980582450066.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 388138968064 + 271915317025 = 623008^2 + 521455^2 .
It is a cyclic number.
It is not a de Polignac number, because 660054285089 - 212 = 660054280993 is a prime.
Together with 660054285091, it forms a pair of twin primes.
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 660054285089.
It is not a weakly prime, because it can be changed into another prime (660054285689) 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, 330027142544 + 330027142545.
It is an arithmetic number, because the mean of its divisors is an integer number (330027142545).
Almost surely, 2660054285089 is an apocalyptic number.
It is an amenable number.
660054285089 is a deficient number, since it is larger than the sum of its proper divisors (1).
660054285089 is an equidigital number, since it uses as much as digits as its factorization.
660054285089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4147200, while the sum is 53.
The spelling of 660054285089 in words is "six hundred sixty billion, fifty-four million, two hundred eighty-five thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •