Base | Representation |
---|---|
bin | 100000111011100011101110… |
… | …0100110101011001111110101 |
3 | 1101222121021121120221002102121 |
4 | 1001313013130212223033311 |
5 | 300431244342134120134 |
6 | 2504020123244235541 |
7 | 115004200314216463 |
oct | 10167073446531765 |
9 | 1358537546832377 |
10 | 289660590535669 |
11 | 84327403a15381 |
12 | 285a21b583bbb1 |
13 | c581b5182c242 |
14 | 517590c5d9833 |
15 | 2374b0b523ab4 |
hex | 10771dc9ab3f5 |
289660590535669 has 2 divisors, whose sum is σ = 289660590535670. Its totient is φ = 289660590535668.
The previous prime is 289660590535663. The next prime is 289660590535681. The reversal of 289660590535669 is 966535095066982.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 281516787085444 + 8143803450225 = 16778462^2 + 2853735^2 .
It is a cyclic number.
It is not a de Polignac number, because 289660590535669 - 211 = 289660590533621 is a prime.
It is a super-2 number, since 2×2896605905356692 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (289660590535663) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 144830295267834 + 144830295267835.
It is an arithmetic number, because the mean of its divisors is an integer number (144830295267835).
Almost surely, 2289660590535669 is an apocalyptic number.
It is an amenable number.
289660590535669 is a deficient number, since it is larger than the sum of its proper divisors (1).
289660590535669 is an equidigital number, since it uses as much as digits as its factorization.
289660590535669 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5668704000, while the sum is 79.
The spelling of 289660590535669 in words is "two hundred eighty-nine trillion, six hundred sixty billion, five hundred ninety million, five hundred thirty-five thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •