Base | Representation |
---|---|
bin | 111110001101110… |
… | …1000110111110001 |
3 | 12101111020002101021 |
4 | 1330123220313301 |
5 | 13233412320311 |
6 | 543052535441 |
7 | 102506322631 |
oct | 17433506761 |
9 | 5344202337 |
10 | 2087620081 |
11 | 981452958 |
12 | 4a3181581 |
13 | 273674c71 |
14 | 15b3866c1 |
15 | c341e171 |
hex | 7c6e8df1 |
2087620081 has 2 divisors, whose sum is σ = 2087620082. Its totient is φ = 2087620080.
The previous prime is 2087620063. The next prime is 2087620091. The reversal of 2087620081 is 1800267802.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1662600625 + 425019456 = 40775^2 + 20616^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2087620081 is a prime.
It is a super-2 number, since 2×20876200812 = 8716315205188893122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2087620091) by changing a digit.
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 as a sum of consecutive naturals, namely, 1043810040 + 1043810041.
It is an arithmetic number, because the mean of its divisors is an integer number (1043810041).
Almost surely, 22087620081 is an apocalyptic number.
It is an amenable number.
2087620081 is a deficient number, since it is larger than the sum of its proper divisors (1).
2087620081 is an equidigital number, since it uses as much as digits as its factorization.
2087620081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10752, while the sum is 34.
The square root of 2087620081 is about 45690.4812953420. The cubic root of 2087620081 is about 1278.0577805615.
Adding to 2087620081 its reverse (1800267802), we get a palindrome (3887887883).
The spelling of 2087620081 in words is "two billion, eighty-seven million, six hundred twenty thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •