Base | Representation |
---|---|
bin | 111100100111110… |
… | …0110100000101101 |
3 | 12020202120122221122 |
4 | 1321033212200231 |
5 | 13131214224122 |
6 | 533502310325 |
7 | 101256563006 |
oct | 17117464055 |
9 | 5222518848 |
10 | 2034133037 |
11 | 954240292 |
12 | 4892883a5 |
13 | 265568621 |
14 | 1542221ad |
15 | bd8a6142 |
hex | 793e682d |
2034133037 has 2 divisors, whose sum is σ = 2034133038. Its totient is φ = 2034133036.
The previous prime is 2034133021. The next prime is 2034133043. The reversal of 2034133037 is 7303314302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1748996041 + 285136996 = 41821^2 + 16886^2 .
It is a cyclic number.
It is not a de Polignac number, because 2034133037 - 24 = 2034133021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2034132997 and 2034133015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2034133007) 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, 1017066518 + 1017066519.
It is an arithmetic number, because the mean of its divisors is an integer number (1017066519).
Almost surely, 22034133037 is an apocalyptic number.
It is an amenable number.
2034133037 is a deficient number, since it is larger than the sum of its proper divisors (1).
2034133037 is an equidigital number, since it uses as much as digits as its factorization.
2034133037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 26.
The square root of 2034133037 is about 45101.3640259361. The cubic root of 2034133037 is about 1267.0481460948.
Adding to 2034133037 its reverse (7303314302), we get a palindrome (9337447339).
The spelling of 2034133037 in words is "two billion, thirty-four million, one hundred thirty-three thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •