Base | Representation |
---|---|
bin | 111100110111111… |
… | …1101110000001001 |
3 | 12021100112200112121 |
4 | 1321233331300021 |
5 | 13140402214331 |
6 | 534404211241 |
7 | 101421646066 |
oct | 17157756011 |
9 | 5240480477 |
10 | 2042616841 |
11 | 9590052a1 |
12 | 490099b21 |
13 | 267249025 |
14 | 1553cdc6d |
15 | be4cec11 |
hex | 79bfdc09 |
2042616841 has 2 divisors, whose sum is σ = 2042616842. Its totient is φ = 2042616840.
The previous prime is 2042616833. The next prime is 2042616853. The reversal of 2042616841 is 1486162402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1407375225 + 635241616 = 37515^2 + 25204^2 .
It is a cyclic number.
It is not a de Polignac number, because 2042616841 - 23 = 2042616833 is a prime.
It is a super-3 number, since 3×20426168413 (a number of 29 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2042616797 and 2042616806.
It is not a weakly prime, because it can be changed into another prime (2042616041) 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, 1021308420 + 1021308421.
It is an arithmetic number, because the mean of its divisors is an integer number (1021308421).
Almost surely, 22042616841 is an apocalyptic number.
It is an amenable number.
2042616841 is a deficient number, since it is larger than the sum of its proper divisors (1).
2042616841 is an equidigital number, since it uses as much as digits as its factorization.
2042616841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 34.
The square root of 2042616841 is about 45195.3187952027. The cubic root of 2042616841 is about 1268.8072048236.
The spelling of 2042616841 in words is "two billion, forty-two million, six hundred sixteen thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •