Base | Representation |
---|---|
bin | 101001011110011… |
… | …010110100001001 |
3 | 1210111100100001012 |
4 | 221132122310021 |
5 | 2411113340014 |
6 | 153014133305 |
7 | 23146354034 |
oct | 5136326411 |
9 | 1714310035 |
10 | 695840009 |
11 | 327868997 |
12 | 175051235 |
13 | b1213a67 |
14 | 685b401b |
15 | 4114ec3e |
hex | 2979ad09 |
695840009 has 2 divisors, whose sum is σ = 695840010. Its totient is φ = 695840008.
The previous prime is 695839997. The next prime is 695840011. The reversal of 695840009 is 900048596.
695840009 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., 670810000 + 25030009 = 25900^2 + 5003^2 .
It is a cyclic number.
It is not a de Polignac number, because 695840009 - 212 = 695835913 is a prime.
It is a Sophie Germain prime.
Together with 695840011, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (695840099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 347920004 + 347920005.
It is an arithmetic number, because the mean of its divisors is an integer number (347920005).
Almost surely, 2695840009 is an apocalyptic number.
It is an amenable number.
695840009 is a deficient number, since it is larger than the sum of its proper divisors (1).
695840009 is an equidigital number, since it uses as much as digits as its factorization.
695840009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 77760, while the sum is 41.
The square root of 695840009 is about 26378.7795206677. The cubic root of 695840009 is about 886.1416141790.
The spelling of 695840009 in words is "six hundred ninety-five million, eight hundred forty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •