Base | Representation |
---|---|
bin | 111011101110100… |
… | …0010011110001000 |
3 | 12011200001212201222 |
4 | 1313131002132020 |
5 | 13101022213000 |
6 | 530510501212 |
7 | 100443402026 |
oct | 16735023610 |
9 | 5150055658 |
10 | 2004101000 |
11 | 939298820 |
12 | 47b204808 |
13 | 25c281ba5 |
14 | 150245716 |
15 | bae22a85 |
hex | 77742788 |
2004101000 has 256 divisors, whose sum is σ = 5535129600. Its totient is φ = 671328000.
The previous prime is 2004100997. The next prime is 2004101063. The reversal of 2004101000 is 1014002.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8986889 + ... + 8987111.
It is an arithmetic number, because the mean of its divisors is an integer number (21621600).
Almost surely, 22004101000 is an apocalyptic number.
2004101000 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 2004101000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2767564800).
2004101000 is an abundant number, since it is smaller than the sum of its proper divisors (3531028600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2004101000 is a wasteful number, since it uses less digits than its factorization.
2004101000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317 (or 303 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
The square root of 2004101000 is about 44767.1866437908. The cubic root of 2004101000 is about 1260.7816180019.
Adding to 2004101000 its reverse (1014002), we get a palindrome (2005115002).
The spelling of 2004101000 in words is "two billion, four million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •