Base | Representation |
---|---|
bin | 111011101000101… |
… | …0101111101010000 |
3 | 12011110022010002200 |
4 | 1313101111331100 |
5 | 13044231110323 |
6 | 530321043200 |
7 | 100405342353 |
oct | 16721257520 |
9 | 5143263080 |
10 | 2001035088 |
11 | 937594308 |
12 | 47a186500 |
13 | 25b74a540 |
14 | 14da8829a |
15 | baa19443 |
hex | 77455f50 |
2001035088 has 120 divisors (see below), whose sum is σ = 6071694720. Its totient is φ = 611539200.
The previous prime is 2001035083. The next prime is 2001035117. The reversal of 2001035088 is 8805301002.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001035083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 279133 + ... + 286211.
It is an arithmetic number, because the mean of its divisors is an integer number (50597456).
Almost surely, 22001035088 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2001035088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3035847360).
2001035088 is an abundant number, since it is smaller than the sum of its proper divisors (4070659632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001035088 is a wasteful number, since it uses less digits than its factorization.
2001035088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7257 (or 7248 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The square root of 2001035088 is about 44732.9306886996. The cubic root of 2001035088 is about 1260.1383672687.
The spelling of 2001035088 in words is "two billion, one million, thirty-five thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •