Base | Representation |
---|---|
bin | 111111111001101110101 |
3 | 10221101100101 |
4 | 13333031311 |
5 | 1014001231 |
6 | 112514101 |
7 | 23540533 |
oct | 7771565 |
9 | 3841311 |
10 | 2093941 |
11 | 1200233 |
12 | 84b931 |
13 | 584125 |
14 | 3c7153 |
15 | 2b5661 |
hex | 1ff375 |
2093941 has 8 divisors (see below), whose sum is σ = 2277720. Its totient is φ = 1916928.
The previous prime is 2093929. The next prime is 2093953. The reversal of 2093941 is 1493902.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2093929) and next prime (2093953).
It can be written as a sum of positive squares in 4 ways, for example, as 894916 + 1199025 = 946^2 + 1095^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2093941 - 27 = 2093813 is a prime.
It is a super-2 number, since 2×20939412 = 8769177822962, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2093981) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1036 + ... + 2293.
It is an arithmetic number, because the mean of its divisors is an integer number (284715).
22093941 is an apocalyptic number.
It is an amenable number.
2093941 is a deficient number, since it is larger than the sum of its proper divisors (183779).
2093941 is a wasteful number, since it uses less digits than its factorization.
2093941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3383.
The product of its (nonzero) digits is 1944, while the sum is 28.
The square root of 2093941 is about 1447.0456108914. The cubic root of 2093941 is about 127.9346386676.
It can be divided in two parts, 20 and 93941, that added together give a triangular number (93961 = T433).
The spelling of 2093941 in words is "two million, ninety-three thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •