Base | Representation |
---|---|
bin | 100110001101100… |
… | …001011101011100 |
3 | 1122200022012020120 |
4 | 212031201131130 |
5 | 2303104013012 |
6 | 143340314540 |
7 | 21613040241 |
oct | 4615413534 |
9 | 1580265216 |
10 | 641079132 |
11 | 2a9966271 |
12 | 15a842a50 |
13 | a2a7c685 |
14 | 611db5c8 |
15 | 3b43458c |
hex | 2636175c |
641079132 has 48 divisors (see below), whose sum is σ = 1570329600. Its totient is φ = 203287680.
The previous prime is 641079119. The next prime is 641079137. The reversal of 641079132 is 231970146.
641079132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 641079093 and 641079102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (641079137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7344 + ... + 36552.
It is an arithmetic number, because the mean of its divisors is an integer number (32715200).
Almost surely, 2641079132 is an apocalyptic number.
641079132 is a gapful number since it is divisible by the number (62) formed by its first and last digit.
It is an amenable number.
641079132 is an abundant number, since it is smaller than the sum of its proper divisors (929250468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
641079132 is a wasteful number, since it uses less digits than its factorization.
641079132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29306 (or 29304 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 33.
The square root of 641079132 is about 25319.5405171579. The cubic root of 641079132 is about 862.2579622466.
The spelling of 641079132 in words is "six hundred forty-one million, seventy-nine thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •