Base | Representation |
---|---|
bin | 11001011010111101100000 |
3 | 110112120100000 |
4 | 121122331200 |
5 | 3201222112 |
6 | 354500000 |
7 | 110433444 |
oct | 31327540 |
9 | 13476300 |
10 | 6664032 |
11 | 3841871 |
12 | 2294600 |
13 | 14c431b |
14 | c56824 |
15 | 8b97dc |
hex | 65af60 |
6664032 has 72 divisors (see below), whose sum is σ = 19675656. Its totient is φ = 2218752.
The previous prime is 6664027. The next prime is 6664069. The reversal of 6664032 is 2304666.
It is a tau number, because it is divible by the number of its divisors (72).
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 = 6663987 and 6664005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7348 + ... + 8204.
It is an arithmetic number, because the mean of its divisors is an integer number (273273).
Almost surely, 26664032 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 6664032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9837828).
6664032 is an abundant number, since it is smaller than the sum of its proper divisors (13011624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6664032 is an equidigital number, since it uses as much as digits as its factorization.
6664032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 882 (or 862 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
The square root of 6664032 is about 2581.4786460476. The cubic root of 6664032 is about 188.1824093468.
Adding to 6664032 its reverse (2304666), we get a palindrome (8968698).
The spelling of 6664032 in words is "six million, six hundred sixty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •