Base | Representation |
---|---|
bin | 1000000000111010110000 |
3 | 10221201220120 |
4 | 20000322300 |
5 | 1014212122 |
6 | 113010240 |
7 | 23600052 |
oct | 10007260 |
9 | 3851816 |
10 | 2100912 |
11 | 12054a0 |
12 | 853980 |
13 | 587358 |
14 | 3c98d2 |
15 | 2b775c |
hex | 200eb0 |
2100912 has 80 divisors (see below), whose sum is σ = 6213888. Its totient is φ = 605440.
The previous prime is 2100899. The next prime is 2100913. The reversal of 2100912 is 2190012.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2100891 and 2100900.
It is not an unprimeable number, because it can be changed into a prime (2100913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12058 + ... + 12230.
22100912 is an apocalyptic number.
2100912 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 2100912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3106944).
2100912 is an abundant number, since it is smaller than the sum of its proper divisors (4112976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2100912 is a wasteful number, since it uses less digits than its factorization.
2100912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218 (or 212 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 2100912 is about 1449.4523103573. The cubic root of 2100912 is about 128.0764517237.
Adding to 2100912 its reverse (2190012), we get a palindrome (4290924).
The spelling of 2100912 in words is "two million, one hundred thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •