Base | Representation |
---|---|
bin | 1010000000000101… |
… | …0110101100111001 |
3 | 20221002202101100012 |
4 | 2200001112230321 |
5 | 20444241202224 |
6 | 1122222351305 |
7 | 123346440644 |
oct | 24001265471 |
9 | 6832671305 |
10 | 2684709689 |
11 | 11584a3142 |
12 | 62b12b535 |
13 | 33a291c1c |
14 | 1b67b2a5b |
15 | 10aa6480e |
hex | a0056b39 |
2684709689 has 2 divisors, whose sum is σ = 2684709690. Its totient is φ = 2684709688.
The previous prime is 2684709673. The next prime is 2684709691. The reversal of 2684709689 is 9869074862.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2502000400 + 182709289 = 50020^2 + 13517^2 .
It is a cyclic number.
It is not a de Polignac number, because 2684709689 - 24 = 2684709673 is a prime.
It is a super-2 number, since 2×26847096892 = 14415332228420953442, which contains 22 as substring.
Together with 2684709691, 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 (2684729689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1342354844 + 1342354845.
It is an arithmetic number, because the mean of its divisors is an integer number (1342354845).
Almost surely, 22684709689 is an apocalyptic number.
It is an amenable number.
2684709689 is a deficient number, since it is larger than the sum of its proper divisors (1).
2684709689 is an equidigital number, since it uses as much as digits as its factorization.
2684709689 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10450944, while the sum is 59.
The square root of 2684709689 is about 51814.1842452431. The cubic root of 2684709689 is about 1389.8431044553.
The spelling of 2684709689 in words is "two billion, six hundred eighty-four million, seven hundred nine thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •