Base | Representation |
---|---|
bin | 111011110001010… |
… | …0010001010011100 |
3 | 12011202210001210000 |
4 | 1313202202022130 |
5 | 13101404312112 |
6 | 531001414300 |
7 | 100461551601 |
oct | 16742421234 |
9 | 5152701700 |
10 | 2005541532 |
11 | 93a092045 |
12 | 47b79a390 |
13 | 25c667787 |
14 | 1504dc6a8 |
15 | bb1097dc |
hex | 778a229c |
2005541532 has 60 divisors (see below), whose sum is σ = 5277731536. Its totient is φ = 664070400.
The previous prime is 2005541519. The next prime is 2005541567. The reversal of 2005541532 is 2351455002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 2005541496 and 2005541505.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 28428 + ... + 69420.
Almost surely, 22005541532 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 2005541532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2638865768).
2005541532 is an abundant number, since it is smaller than the sum of its proper divisors (3272190004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2005541532 is a wasteful number, since it uses less digits than its factorization.
2005541532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41160 (or 41149 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 2005541532 is about 44783.2729040654. The cubic root of 2005541532 is about 1261.0836256159.
Adding to 2005541532 its reverse (2351455002), we get a palindrome (4356996534).
The spelling of 2005541532 in words is "two billion, five million, five hundred forty-one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •