Base | Representation |
---|---|
bin | 111111111001001010100 |
3 | 10221100221200 |
4 | 13333021110 |
5 | 1013444102 |
6 | 112512500 |
7 | 23536641 |
oct | 7771124 |
9 | 3840850 |
10 | 2093652 |
11 | 11aaaa0 |
12 | 84b730 |
13 | 583c62 |
14 | 3c6dc8 |
15 | 2b551c |
hex | 1ff254 |
2093652 has 72 divisors (see below), whose sum is σ = 6132672. Its totient is φ = 595200.
The previous prime is 2093639. The next prime is 2093653. The reversal of 2093652 is 2563902.
2093652 is a `hidden beast` number, since 2 + 0 + 9 + 3 + 652 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2093653) 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 23 ways as a sum of consecutive naturals, for example, 6577 + ... + 6887.
It is an arithmetic number, because the mean of its divisors is an integer number (85176).
22093652 is an apocalyptic number.
2093652 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2093652, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3066336).
2093652 is an abundant number, since it is smaller than the sum of its proper divisors (4039020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2093652 is a wasteful number, since it uses less digits than its factorization.
2093652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349 (or 344 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 2093652 is about 1446.9457488102. The cubic root of 2093652 is about 127.9287526674.
The spelling of 2093652 in words is "two million, ninety-three thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •