Base | Representation |
---|---|
bin | 111110001101100… |
… | …1011001110111001 |
3 | 12101110222220211222 |
4 | 1330123023032321 |
5 | 13233344424211 |
6 | 543050201425 |
7 | 102505305662 |
oct | 17433131671 |
9 | 5343886758 |
10 | 2087498681 |
11 | 98137a724 |
12 | 4a3123275 |
13 | 273631928 |
14 | 15b354369 |
15 | c33e81db |
hex | 7c6cb3b9 |
2087498681 has 2 divisors, whose sum is σ = 2087498682. Its totient is φ = 2087498680.
The previous prime is 2087498659. The next prime is 2087498687. The reversal of 2087498681 is 1868947802.
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., 2087119225 + 379456 = 45685^2 + 616^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2087498681 is a prime.
It is a super-2 number, since 2×20874986812 = 8715301486353479522, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2087498687) 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, 1043749340 + 1043749341.
It is an arithmetic number, because the mean of its divisors is an integer number (1043749341).
Almost surely, 22087498681 is an apocalyptic number.
It is an amenable number.
2087498681 is a deficient number, since it is larger than the sum of its proper divisors (1).
2087498681 is an equidigital number, since it uses as much as digits as its factorization.
2087498681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1548288, while the sum is 53.
The square root of 2087498681 is about 45689.1527717466. The cubic root of 2087498681 is about 1278.0330060629.
The spelling of 2087498681 in words is "two billion, eighty-seven million, four hundred ninety-eight thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •