Base | Representation |
---|---|
bin | 1010000001101111… |
… | …1011010000000001 |
3 | 20221120212021010202 |
4 | 2200123323100001 |
5 | 21003032101022 |
6 | 1123031534545 |
7 | 123462601244 |
oct | 24033732001 |
9 | 6846767122 |
10 | 2691675137 |
11 | 1161420408 |
12 | 63152a455 |
13 | 33b8604a8 |
14 | 1b76a725b |
15 | 10b48d592 |
hex | a06fb401 |
2691675137 has 2 divisors, whose sum is σ = 2691675138. Its totient is φ = 2691675136.
The previous prime is 2691675083. The next prime is 2691675139. The reversal of 2691675137 is 7315761962.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2687281921 + 4393216 = 51839^2 + 2096^2 .
It is a cyclic number.
It is not a de Polignac number, because 2691675137 - 230 = 1617933313 is a prime.
Together with 2691675139, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2691675091 and 2691675100.
It is not a weakly prime, because it can be changed into another prime (2691675139) 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, 1345837568 + 1345837569.
It is an arithmetic number, because the mean of its divisors is an integer number (1345837569).
Almost surely, 22691675137 is an apocalyptic number.
It is an amenable number.
2691675137 is a deficient number, since it is larger than the sum of its proper divisors (1).
2691675137 is an equidigital number, since it uses as much as digits as its factorization.
2691675137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 476280, while the sum is 47.
The square root of 2691675137 is about 51881.3563527400. The cubic root of 2691675137 is about 1391.0440436914.
The spelling of 2691675137 in words is "two billion, six hundred ninety-one million, six hundred seventy-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •