Base | Representation |
---|---|
bin | 100110001111001… |
… | …000010110001000 |
3 | 1122201002121022201 |
4 | 212033020112020 |
5 | 2303211004202 |
6 | 143353325544 |
7 | 21616444000 |
oct | 4617102610 |
9 | 1581077281 |
10 | 641500552 |
11 | 2aa123950 |
12 | 15aa068b4 |
13 | a2b99434 |
14 | 612ab000 |
15 | 3b4b9387 |
hex | 263c8588 |
641500552 has 128 divisors (see below), whose sum is σ = 1562976000. Its totient is φ = 244608000.
The previous prime is 641500543. The next prime is 641500571. The reversal of 641500552 is 255005146.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 641500552.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1599552 + ... + 1599952.
It is an arithmetic number, because the mean of its divisors is an integer number (12210750).
Almost surely, 2641500552 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 641500552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (781488000).
641500552 is an abundant number, since it is smaller than the sum of its proper divisors (921475448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
641500552 is a wasteful number, since it uses less digits than its factorization.
641500552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 492 (or 474 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 28.
The square root of 641500552 is about 25327.8611809209. The cubic root of 641500552 is about 862.4468589257.
Adding to 641500552 its reverse (255005146), we get a palindrome (896505698).
The spelling of 641500552 in words is "six hundred forty-one million, five hundred thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •