Base | Representation |
---|---|
bin | 111110000100001… |
… | …1101100111010111 |
3 | 12101010202200211221 |
4 | 1330020131213113 |
5 | 13231120440424 |
6 | 542353111211 |
7 | 102415515256 |
oct | 17410354727 |
9 | 5333680757 |
10 | 2082593239 |
11 | 97962a141 |
12 | 4a1558507 |
13 | 272604bbc |
14 | 15a83879d |
15 | c2c799e4 |
hex | 7c21d9d7 |
2082593239 has 4 divisors (see below), whose sum is σ = 2082696856. Its totient is φ = 2082489624.
The previous prime is 2082593231. The next prime is 2082593263. The reversal of 2082593239 is 9323952802.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 2082593239 - 23 = 2082593231 is a prime.
It is a super-2 number, since 2×20825932392 = 8674389198257022242, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2082593195 and 2082593204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2082593231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10884 + ... + 65449.
It is an arithmetic number, because the mean of its divisors is an integer number (520674214).
Almost surely, 22082593239 is an apocalyptic number.
2082593239 is a deficient number, since it is larger than the sum of its proper divisors (103617).
2082593239 is an equidigital number, since it uses as much as digits as its factorization.
2082593239 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103616.
The product of its (nonzero) digits is 233280, while the sum is 43.
The square root of 2082593239 is about 45635.4384113925. The cubic root of 2082593239 is about 1277.0311317386.
The spelling of 2082593239 in words is "two billion, eighty-two million, five hundred ninety-three thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •