Base | Representation |
---|---|
bin | 111101001110010111000 |
3 | 10202220222201 |
4 | 13221302320 |
5 | 1003144300 |
6 | 110555544 |
7 | 23023660 |
oct | 7516270 |
9 | 3686881 |
10 | 2006200 |
11 | 1150319 |
12 | 808bb4 |
13 | 553201 |
14 | 3a31a0 |
15 | 29966a |
hex | 1e9cb8 |
2006200 has 48 divisors (see below), whose sum is σ = 5334480. Its totient is φ = 687360.
The previous prime is 2006197. The next prime is 2006201. The reversal of 2006200 is 26002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2006201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 684 + ... + 2116.
It is an arithmetic number, because the mean of its divisors is an integer number (111135).
22006200 is an apocalyptic number.
2006200 is a gapful number since it is divisible by the number (20) 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 2006200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2667240).
2006200 is an abundant number, since it is smaller than the sum of its proper divisors (3328280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2006200 is a wasteful number, since it uses less digits than its factorization.
2006200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1456 (or 1447 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 10.
The square root of 2006200 is about 1416.4038971988. The cubic root of 2006200 is about 126.1221625310.
It can be divided in two parts, 200 and 6200, that added together give a square (6400 = 802).
The spelling of 2006200 in words is "two million, six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •