Base | Representation |
---|---|
bin | 10011100101110100000 |
3 | 1012121121000 |
4 | 2130232200 |
5 | 131020302 |
6 | 21432000 |
7 | 5312403 |
oct | 2345640 |
9 | 1177530 |
10 | 641952 |
11 | 3a9343 |
12 | 26b600 |
13 | 19626c |
14 | 129d3a |
15 | ca31c |
hex | 9cba0 |
641952 has 48 divisors (see below), whose sum is σ = 1874880. Its totient is φ = 213696.
The previous prime is 641929. The next prime is 641959. The reversal of 641952 is 259146.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (641959) by changing a digit.
641952 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 493 + ... + 1235.
It is an arithmetic number, because the mean of its divisors is an integer number (39060).
2641952 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 641952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (937440).
641952 is an abundant number, since it is smaller than the sum of its proper divisors (1232928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
641952 is a wasteful number, since it uses less digits than its factorization.
641952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 762 (or 748 counting only the distinct ones).
The product of its digits is 2160, while the sum is 27.
The square root of 641952 is about 801.2190711659. The cubic root of 641952 is about 86.2649123554.
It can be divided in two parts, 64 and 1952, that added together give a triangular number (2016 = T63).
The spelling of 641952 in words is "six hundred forty-one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •