Base | Representation |
---|---|
bin | 10100000011111111101… |
… | …10000010000110010101 |
3 | 2102220022021010220110211 |
4 | 22001333312002012111 |
5 | 42243231421410130 |
6 | 1244402300445421 |
7 | 100542323150263 |
oct | 12017766020625 |
9 | 2386267126424 |
10 | 689339638165 |
11 | 246390289002 |
12 | b1722549871 |
13 | 50009a0b329 |
14 | 255155a5433 |
15 | 12de8256a2a |
hex | a07fd82195 |
689339638165 has 8 divisors (see below), whose sum is σ = 827441327520. Its totient is φ = 551315869392.
The previous prime is 689339638159. The next prime is 689339638171. The reversal of 689339638165 is 561836933986.
It is an interprime number because it is at equal distance from previous prime (689339638159) and next prime (689339638171).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 689339638165 - 213 = 689339629973 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 689339638165.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 19460679 + ... + 19496068.
It is an arithmetic number, because the mean of its divisors is an integer number (103430165940).
Almost surely, 2689339638165 is an apocalyptic number.
It is an amenable number.
689339638165 is a deficient number, since it is larger than the sum of its proper divisors (138101689355).
689339638165 is a wasteful number, since it uses less digits than its factorization.
689339638165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38960291.
The product of its digits is 151165440, while the sum is 67.
The spelling of 689339638165 in words is "six hundred eighty-nine billion, three hundred thirty-nine million, six hundred thirty-eight thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •