Base | Representation |
---|---|
bin | 111111111001000100101 |
3 | 10221100212221 |
4 | 13333020211 |
5 | 1013443410 |
6 | 112512341 |
7 | 23536543 |
oct | 7771045 |
9 | 3840787 |
10 | 2093605 |
11 | 11aaa58 |
12 | 84b6b1 |
13 | 583c27 |
14 | 3c6d93 |
15 | 2b54da |
hex | 1ff225 |
2093605 has 4 divisors (see below), whose sum is σ = 2512332. Its totient is φ = 1674880.
The previous prime is 2093603. The next prime is 2093617. The reversal of 2093605 is 5063902.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5063902 = 2 ⋅2531951.
It can be written as a sum of positive squares in 2 ways, for example, as 498436 + 1595169 = 706^2 + 1263^2 .
It is not a de Polignac number, because 2093605 - 21 = 2093603 is a prime.
It is a Duffinian number.
2093605 is a lucky number.
It is a self number, because there is not a number n which added to its sum of digits gives 2093605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2093603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 209356 + ... + 209365.
It is an arithmetic number, because the mean of its divisors is an integer number (628083).
22093605 is an apocalyptic number.
It is an amenable number.
2093605 is a deficient number, since it is larger than the sum of its proper divisors (418727).
2093605 is an equidigital number, since it uses as much as digits as its factorization.
2093605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418726.
The product of its (nonzero) digits is 1620, while the sum is 25.
The square root of 2093605 is about 1446.9295076126. The cubic root of 2093605 is about 127.9277953774.
The spelling of 2093605 in words is "two million, ninety-three thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •