Base | Representation |
---|---|
bin | 100110001001… |
… | …111001010110 |
3 | 200211011011200 |
4 | 212021321112 |
5 | 10030031011 |
6 | 554213330 |
7 | 151005240 |
oct | 46117126 |
9 | 20734150 |
10 | 10002006 |
11 | 5711723 |
12 | 3424246 |
13 | 20c2761 |
14 | 1485090 |
15 | d28856 |
hex | 989e56 |
10002006 has 48 divisors (see below), whose sum is σ = 24969984. Its totient is φ = 2834352.
The previous prime is 10001963. The next prime is 10002007. The reversal of 10002006 is 60020001.
10002006 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002007) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20295 + ... + 20781.
It is an arithmetic number, because the mean of its divisors is an integer number (520208).
Almost surely, 210002006 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10002006, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12484992).
10002006 is an abundant number, since it is smaller than the sum of its proper divisors (14967978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10002006 is a wasteful number, since it uses less digits than its factorization.
10002006 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 665 (or 662 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 10002006 is about 3162.5948207129. The cubic root of 10002006 is about 215.4578740266.
Adding to 10002006 its reverse (60020001), we get a palindrome (70022007).
The spelling of 10002006 in words is "ten million, two thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •