Base | Representation |
---|---|
bin | 111100110110001… |
… | …0100001111101001 |
3 | 12021021202002112121 |
4 | 1321230110033221 |
5 | 13140131113033 |
6 | 534331511241 |
7 | 101410553443 |
oct | 17154241751 |
9 | 5237662477 |
10 | 2041660393 |
11 | 958511743 |
12 | 48b8b8521 |
13 | 266ca2896 |
14 | 155221493 |
15 | be39162d |
hex | 79b143e9 |
2041660393 has 2 divisors, whose sum is σ = 2041660394. Its totient is φ = 2041660392.
The previous prime is 2041660391. The next prime is 2041660427. The reversal of 2041660393 is 3930661402.
It is a happy number.
It is an a-pointer prime, because the next prime (2041660427) can be obtained adding 2041660393 to its sum of digits (34).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1290461929 + 751198464 = 35923^2 + 27408^2 .
It is a cyclic number.
It is not a de Polignac number, because 2041660393 - 21 = 2041660391 is a prime.
Together with 2041660391, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2041660391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1020830196 + 1020830197.
It is an arithmetic number, because the mean of its divisors is an integer number (1020830197).
Almost surely, 22041660393 is an apocalyptic number.
It is an amenable number.
2041660393 is a deficient number, since it is larger than the sum of its proper divisors (1).
2041660393 is an equidigital number, since it uses as much as digits as its factorization.
2041660393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 34.
The square root of 2041660393 is about 45184.7362833955. The cubic root of 2041660393 is about 1268.6091357664.
The spelling of 2041660393 in words is "two billion, forty-one million, six hundred sixty thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •