Base | Representation |
---|---|
bin | 11110001101000111000… |
… | …000110000100010111101 |
3 | 21100102122100120210212111 |
4 | 132031013000300202331 |
5 | 233001423102211044 |
6 | 4225313441534021 |
7 | 302650542603304 |
oct | 36150700604275 |
9 | 7312570523774 |
10 | 2075660585149 |
11 | 7303123192a8 |
12 | 29633a644311 |
13 | 120970659598 |
14 | 726691a143b |
15 | 38ed552db34 |
hex | 1e3470308bd |
2075660585149 has 2 divisors, whose sum is σ = 2075660585150. Its totient is φ = 2075660585148.
The previous prime is 2075660585137. The next prime is 2075660585179. The reversal of 2075660585149 is 9415850665702.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1966846368249 + 108814216900 = 1402443^2 + 329870^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2075660585149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2075660585093 and 2075660585102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2075660585129) 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, 1037830292574 + 1037830292575.
It is an arithmetic number, because the mean of its divisors is an integer number (1037830292575).
Almost surely, 22075660585149 is an apocalyptic number.
It is an amenable number.
2075660585149 is a deficient number, since it is larger than the sum of its proper divisors (1).
2075660585149 is an equidigital number, since it uses as much as digits as its factorization.
2075660585149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144000, while the sum is 58.
The spelling of 2075660585149 in words is "two trillion, seventy-five billion, six hundred sixty million, five hundred eighty-five thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •