Base | Representation |
---|---|
bin | 111100110010000… |
… | …0111101101010101 |
3 | 12021010200221100112 |
4 | 1321210013231111 |
5 | 13134103340033 |
6 | 534213452405 |
7 | 101353364546 |
oct | 17144075525 |
9 | 5233627315 |
10 | 2039511893 |
11 | 957284521 |
12 | 48b041105 |
13 | 2666cc993 |
14 | 154c224cd |
15 | be0b9c48 |
hex | 79907b55 |
2039511893 has 2 divisors, whose sum is σ = 2039511894. Its totient is φ = 2039511892.
The previous prime is 2039511869. The next prime is 2039511989. The reversal of 2039511893 is 3981159302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2024820004 + 14691889 = 44998^2 + 3833^2 .
It is a cyclic number.
It is not a de Polignac number, because 2039511893 - 214 = 2039495509 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2039511893.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2039511853) 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, 1019755946 + 1019755947.
It is an arithmetic number, because the mean of its divisors is an integer number (1019755947).
Almost surely, 22039511893 is an apocalyptic number.
It is an amenable number.
2039511893 is a deficient number, since it is larger than the sum of its proper divisors (1).
2039511893 is an equidigital number, since it uses as much as digits as its factorization.
2039511893 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 41.
The square root of 2039511893 is about 45160.9554039770. The cubic root of 2039511893 is about 1268.1639811958.
The spelling of 2039511893 in words is "two billion, thirty-nine million, five hundred eleven thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •