Base | Representation |
---|---|
bin | 1000000100001100… |
… | …1010000111101101 |
3 | 12120212222220102012 |
4 | 2001003022013231 |
5 | 13413230314444 |
6 | 554501211005 |
7 | 104436644045 |
oct | 20103120755 |
9 | 5525886365 |
10 | 2165088749 |
11 | a1115524a |
12 | 505100a65 |
13 | 28672a105 |
14 | 167790725 |
15 | ca122b9e |
hex | 810ca1ed |
2165088749 has 2 divisors, whose sum is σ = 2165088750. Its totient is φ = 2165088748.
The previous prime is 2165088689. The next prime is 2165088797. The reversal of 2165088749 is 9478805612.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2123550724 + 41538025 = 46082^2 + 6445^2 .
It is a cyclic number.
It is not a de Polignac number, because 2165088749 - 224 = 2148311533 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2165088697 and 2165088706.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2165088349) 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, 1082544374 + 1082544375.
It is an arithmetic number, because the mean of its divisors is an integer number (1082544375).
Almost surely, 22165088749 is an apocalyptic number.
It is an amenable number.
2165088749 is a deficient number, since it is larger than the sum of its proper divisors (1).
2165088749 is an equidigital number, since it uses as much as digits as its factorization.
2165088749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 967680, while the sum is 50.
The square root of 2165088749 is about 46530.5141708105. The cubic root of 2165088749 is about 1293.6751454151.
The spelling of 2165088749 in words is "two billion, one hundred sixty-five million, eighty-eight thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •