Base | Representation |
---|---|
bin | 1001110010101010110101101… |
… | …1110100111100001010110101 |
3 | 10100100122122112110012111020211 |
4 | 2130222231123310330022311 |
5 | 1210303032432300444424 |
6 | 10441240044155025421 |
7 | 265063536101412664 |
oct | 23452553364741265 |
9 | 3310578473174224 |
10 | 689030258999989 |
11 | 18a601101250815 |
12 | 6534281b73b271 |
13 | 2376137546793a |
14 | c2213574d2ddb |
15 | 549d3d1a1cb94 |
hex | 272ab5bd3c2b5 |
689030258999989 has 2 divisors, whose sum is σ = 689030258999990. Its totient is φ = 689030258999988.
The previous prime is 689030258999941. The next prime is 689030259000007. The reversal of 689030258999989 is 989999852030986.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 495500565864964 + 193529693135025 = 22259842^2 + 13911495^2 .
It is a cyclic number.
It is not a de Polignac number, because 689030258999989 - 213 = 689030258991797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 689030258999897 and 689030258999906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (689030258990989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 344515129499994 + 344515129499995.
It is an arithmetic number, because the mean of its divisors is an integer number (344515129499995).
Almost surely, 2689030258999989 is an apocalyptic number.
It is an amenable number.
689030258999989 is a deficient number, since it is larger than the sum of its proper divisors (1).
689030258999989 is an equidigital number, since it uses as much as digits as its factorization.
689030258999989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48977602560, while the sum is 94.
The spelling of 689030258999989 in words is "six hundred eighty-nine trillion, thirty billion, two hundred fifty-eight million, nine hundred ninety-nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •