Base | Representation |
---|---|
bin | 111101100010110… |
… | …0010110110011001 |
3 | 12022220202110110121 |
4 | 1323011202312121 |
5 | 13212123113113 |
6 | 540525113241 |
7 | 102113433643 |
oct | 17305426631 |
9 | 5286673417 |
10 | 2065051033 |
11 | 96a738451 |
12 | 4976b8821 |
13 | 26baa23b6 |
14 | 15838d893 |
15 | c1461e8d |
hex | 7b162d99 |
2065051033 has 2 divisors, whose sum is σ = 2065051034. Its totient is φ = 2065051032.
The previous prime is 2065050997. The next prime is 2065051057. The reversal of 2065051033 is 3301505602.
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., 1900262464 + 164788569 = 43592^2 + 12837^2 .
It is a cyclic number.
It is not a de Polignac number, because 2065051033 - 29 = 2065050521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2065050989 and 2065051007.
It is not a weakly prime, because it can be changed into another prime (2065051133) 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, 1032525516 + 1032525517.
It is an arithmetic number, because the mean of its divisors is an integer number (1032525517).
Almost surely, 22065051033 is an apocalyptic number.
It is an amenable number.
2065051033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2065051033 is an equidigital number, since it uses as much as digits as its factorization.
2065051033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 2065051033 is about 45442.8325811673. The cubic root of 2065051033 is about 1273.4354322632.
Adding to 2065051033 its reverse (3301505602), we get a palindrome (5366556635).
The spelling of 2065051033 in words is "two billion, sixty-five million, fifty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •