Base | Representation |
---|---|
bin | 100001000001111100001000… |
… | …1001010110010010010001101 |
3 | 1102002201010110002001001102222 |
4 | 1002003320101022302102031 |
5 | 301040132044302322133 |
6 | 2505531052445225125 |
7 | 115124436464413442 |
oct | 10203702112622215 |
9 | 1362633402031388 |
10 | 290537645745293 |
11 | 846353617a45a1 |
12 | 287041858621a5 |
13 | c6167757b98bb |
14 | 51a61505859c9 |
15 | 238c83e4e8e98 |
hex | 1083e112b248d |
290537645745293 has 2 divisors, whose sum is σ = 290537645745294. Its totient is φ = 290537645745292.
The previous prime is 290537645745283. The next prime is 290537645745337. The reversal of 290537645745293 is 392547546735092.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 233123488897924 + 57414156847369 = 15268382^2 + 7577213^2 .
It is a cyclic number.
It is not a de Polignac number, because 290537645745293 - 238 = 290262767838349 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (290537645745233) 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, 145268822872646 + 145268822872647.
It is an arithmetic number, because the mean of its divisors is an integer number (145268822872647).
Almost surely, 2290537645745293 is an apocalyptic number.
It is an amenable number.
290537645745293 is a deficient number, since it is larger than the sum of its proper divisors (1).
290537645745293 is an equidigital number, since it uses as much as digits as its factorization.
290537645745293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1714608000, while the sum is 71.
The spelling of 290537645745293 in words is "two hundred ninety trillion, five hundred thirty-seven billion, six hundred forty-five million, seven hundred forty-five thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •