Base | Representation |
---|---|
bin | 10100000110010100110… |
… | …01110101011010101101 |
3 | 2110000112102221011121201 |
4 | 22003022121311122231 |
5 | 42303312134144024 |
6 | 1245130343525501 |
7 | 100615322466634 |
oct | 12031231653255 |
9 | 2400472834551 |
10 | 690590537389 |
11 | 24697239a115 |
12 | b1a11459891 |
13 | 50178c1429c |
14 | 255d378451b |
15 | 12e6ce98744 |
hex | a0ca6756ad |
690590537389 has 2 divisors, whose sum is σ = 690590537390. Its totient is φ = 690590537388.
The previous prime is 690590537347. The next prime is 690590537401. The reversal of 690590537389 is 983735095096.
690590537389 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., 676794155625 + 13796381764 = 822675^2 + 117458^2 .
It is a cyclic number.
It is not a de Polignac number, because 690590537389 - 233 = 682000602797 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 690590537389.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (690590537339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 345295268694 + 345295268695.
It is an arithmetic number, because the mean of its divisors is an integer number (345295268695).
Almost surely, 2690590537389 is an apocalyptic number.
It is an amenable number.
690590537389 is a deficient number, since it is larger than the sum of its proper divisors (1).
690590537389 is an equidigital number, since it uses as much as digits as its factorization.
690590537389 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 55112400, while the sum is 64.
The spelling of 690590537389 in words is "six hundred ninety billion, five hundred ninety million, five hundred thirty-seven thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •