Base | Representation |
---|---|
bin | 111011110001010… |
… | …0100010101110000 |
3 | 12011202210112000020 |
4 | 1313202210111300 |
5 | 13101410103243 |
6 | 531001523440 |
7 | 100461616566 |
oct | 16742442560 |
9 | 5152715006 |
10 | 2005550448 |
11 | 93a098810 |
12 | 47b7a3580 |
13 | 25c66b855 |
14 | 150501a36 |
15 | bb10c283 |
hex | 778a4570 |
2005550448 has 160 divisors (see below), whose sum is σ = 5882837760. Its totient is φ = 583188480.
The previous prime is 2005550447. The next prime is 2005550461. The reversal of 2005550448 is 8440555002.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2005550447) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3475536 + ... + 3476112.
It is an arithmetic number, because the mean of its divisors is an integer number (36767736).
Almost surely, 22005550448 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 2005550448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2941418880).
2005550448 is an abundant number, since it is smaller than the sum of its proper divisors (3877287312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2005550448 is a wasteful number, since it uses less digits than its factorization.
2005550448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855 (or 849 counting only the distinct ones).
The product of its (nonzero) digits is 32000, while the sum is 33.
The square root of 2005550448 is about 44783.3724500511. The cubic root of 2005550448 is about 1261.0854944054.
The spelling of 2005550448 in words is "two billion, five million, five hundred fifty thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •