Base | Representation |
---|---|
bin | 1000101101111101… |
… | …0110110101101001 |
3 | 20001002121011122021 |
4 | 2023133112311221 |
5 | 14243101044113 |
6 | 1024115424441 |
7 | 111664552066 |
oct | 21337266551 |
9 | 6032534567 |
10 | 2340253033 |
11 | aa1014818 |
12 | 5538b5121 |
13 | 2b3ac9c11 |
14 | 182b49c6d |
15 | da6c348d |
hex | 8b7d6d69 |
2340253033 has 2 divisors, whose sum is σ = 2340253034. Its totient is φ = 2340253032.
The previous prime is 2340253021. The next prime is 2340253039. The reversal of 2340253033 is 3303520432.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2043311209 + 296941824 = 45203^2 + 17232^2 .
It is a cyclic number.
It is not a de Polignac number, because 2340253033 - 229 = 1803382121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2340252989 and 2340253007.
It is not a weakly prime, because it can be changed into another prime (2340253039) 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, 1170126516 + 1170126517.
It is an arithmetic number, because the mean of its divisors is an integer number (1170126517).
Almost surely, 22340253033 is an apocalyptic number.
It is an amenable number.
2340253033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2340253033 is an equidigital number, since it uses as much as digits as its factorization.
2340253033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 25.
The square root of 2340253033 is about 48376.1618258415. The cubic root of 2340253033 is about 1327.6622458494.
Adding to 2340253033 its reverse (3303520432), we get a palindrome (5643773465).
The spelling of 2340253033 in words is "two billion, three hundred forty million, two hundred fifty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •