Base | Representation |
---|---|
bin | 111101011000010… |
… | …1111010111101001 |
3 | 12022112111101100002 |
4 | 1322300233113221 |
5 | 13204224103124 |
6 | 540212152345 |
7 | 102016200551 |
oct | 17260572751 |
9 | 5275441302 |
10 | 2059597289 |
11 | 967652a22 |
12 | 4959086b5 |
13 | 26a912c29 |
14 | 157770161 |
15 | c0c360ae |
hex | 7ac2f5e9 |
2059597289 has 2 divisors, whose sum is σ = 2059597290. Its totient is φ = 2059597288.
The previous prime is 2059597271. The next prime is 2059597291. The reversal of 2059597289 is 9827959502.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1834837225 + 224760064 = 42835^2 + 14992^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2059597289 is a prime.
It is a super-2 number, since 2×20595972892 = 8483881985712299042, which contains 22 as substring.
Together with 2059597291, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2059597249) 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, 1029798644 + 1029798645.
It is an arithmetic number, because the mean of its divisors is an integer number (1029798645).
Almost surely, 22059597289 is an apocalyptic number.
It is an amenable number.
2059597289 is a deficient number, since it is larger than the sum of its proper divisors (1).
2059597289 is an equidigital number, since it uses as much as digits as its factorization.
2059597289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4082400, while the sum is 56.
The square root of 2059597289 is about 45382.7862630756. The cubic root of 2059597289 is about 1272.3134077438.
The spelling of 2059597289 in words is "two billion, fifty-nine million, five hundred ninety-seven thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •