Base | Representation |
---|---|
bin | 111111010001111… |
… | …0100101011100101 |
3 | 12110222101211111212 |
4 | 1332203310223211 |
5 | 13322032220122 |
6 | 550410041205 |
7 | 103421631266 |
oct | 17643645345 |
9 | 5428354455 |
10 | 2123320037 |
11 | 99a616853 |
12 | 4b3119205 |
13 | 27ab944b7 |
14 | 161dda96d |
15 | c6621ce2 |
hex | 7e8f4ae5 |
2123320037 has 2 divisors, whose sum is σ = 2123320038. Its totient is φ = 2123320036.
The previous prime is 2123320033. The next prime is 2123320127. The reversal of 2123320037 is 7300233212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2123274241 + 45796 = 46079^2 + 214^2 .
It is a cyclic number.
It is not a de Polignac number, because 2123320037 - 22 = 2123320033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2123319994 and 2123320021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2123320033) 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, 1061660018 + 1061660019.
It is an arithmetic number, because the mean of its divisors is an integer number (1061660019).
Almost surely, 22123320037 is an apocalyptic number.
It is an amenable number.
2123320037 is a deficient number, since it is larger than the sum of its proper divisors (1).
2123320037 is an equidigital number, since it uses as much as digits as its factorization.
2123320037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 23.
The square root of 2123320037 is about 46079.4969265073. The cubic root of 2123320037 is about 1285.3019093082.
Adding to 2123320037 its reverse (7300233212), we get a palindrome (9423553249).
The spelling of 2123320037 in words is "two billion, one hundred twenty-three million, three hundred twenty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •