Base | Representation |
---|---|
bin | 111111110100010001110 |
3 | 10221020112000 |
4 | 13332202032 |
5 | 1013404100 |
6 | 112453130 |
7 | 23526435 |
oct | 7764216 |
9 | 3836460 |
10 | 2091150 |
11 | 11a9126 |
12 | 84a1a6 |
13 | 582a89 |
14 | 3c611c |
15 | 2b4900 |
hex | 1fe88e |
2091150 has 48 divisors (see below), whose sum is σ = 5766000. Its totient is φ = 557280.
The previous prime is 2091149. The next prime is 2091151. The reversal of 2091150 is 511902.
It is an interprime number because it is at equal distance from previous prime (2091149) and next prime (2091151).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2091151) 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, 576 + ... + 2124.
It is an arithmetic number, because the mean of its divisors is an integer number (120125).
22091150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2091150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2883000).
2091150 is an abundant number, since it is smaller than the sum of its proper divisors (3674850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2091150 is a wasteful number, since it uses less digits than its factorization.
2091150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1570 (or 1559 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 18.
The square root of 2091150 is about 1446.0809105994. The cubic root of 2091150 is about 127.8777723189.
The spelling of 2091150 in words is "two million, ninety-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •