Base | Representation |
---|---|
bin | 111011101001101… |
… | …0100101001010000 |
3 | 12011111021110220122 |
4 | 1313103110221100 |
5 | 13044344212000 |
6 | 530340125412 |
7 | 100412633255 |
oct | 16723245120 |
9 | 5144243818 |
10 | 2001554000 |
11 | 937909166 |
12 | 47a396868 |
13 | 25b89c7a4 |
14 | 14db8142c |
15 | baabd085 |
hex | 774d4a50 |
2001554000 has 40 divisors (see below), whose sum is σ = 4839762408. Its totient is φ = 800620800.
The previous prime is 2001553963. The next prime is 2001554011. The reversal of 2001554000 is 4551002.
2001554000 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 602176 + 2000951824 = 776^2 + 44732^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 2001554000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 498389 + ... + 502388.
Almost surely, 22001554000 is an apocalyptic number.
2001554000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2001554000 is an abundant number, since it is smaller than the sum of its proper divisors (2838208408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001554000 is a wasteful number, since it uses less digits than its factorization.
2001554000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000800 (or 1000784 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 17.
The square root of 2001554000 is about 44738.7304245438. The cubic root of 2001554000 is about 1260.2472849665.
The spelling of 2001554000 in words is "two billion, one million, five hundred fifty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •