Base | Representation |
---|---|
bin | 100110001101110… |
… | …110110001100000 |
3 | 1122200110121222220 |
4 | 212031312301200 |
5 | 2303114311212 |
6 | 143342231040 |
7 | 21613552614 |
oct | 4615666140 |
9 | 1580417886 |
10 | 641166432 |
11 | 2a9a15915 |
12 | 15a885480 |
13 | a2ab032a |
14 | 61221344 |
15 | 3b45038c |
hex | 26376c60 |
641166432 has 24 divisors (see below), whose sum is σ = 1683062136. Its totient is φ = 213722112.
The previous prime is 641166391. The next prime is 641166437. The reversal of 641166432 is 234661146.
It is a tau number, because it is divible by the number of its divisors (24).
It is a super-2 number, since 2×6411664322 = 822188787047221248, which contains 22 as substring.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 641166393 and 641166402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (641166437) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3339313 + ... + 3339504.
It is an arithmetic number, because the mean of its divisors is an integer number (70127589).
Almost surely, 2641166432 is an apocalyptic number.
It is an amenable number.
641166432 is an abundant number, since it is smaller than the sum of its proper divisors (1041895704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
641166432 is a wasteful number, since it uses less digits than its factorization.
641166432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6678830 (or 6678822 counting only the distinct ones).
The product of its digits is 20736, while the sum is 33.
The square root of 641166432 is about 25321.2644234051. The cubic root of 641166432 is about 862.2971002665.
The spelling of 641166432 in words is "six hundred forty-one million, one hundred sixty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •