Base | Representation |
---|---|
bin | 111101010011… |
… | …1110110000000 |
3 | 2020111010022222 |
4 | 1322213312000 |
5 | 31212113033 |
6 | 3104550212 |
7 | 540140345 |
oct | 172476600 |
9 | 66433288 |
10 | 32144768 |
11 | 17165927 |
12 | a922368 |
13 | 6876296 |
14 | 43aa7cc |
15 | 2c4e598 |
hex | 1ea7d80 |
32144768 has 32 divisors (see below), whose sum is σ = 66112320. Its totient is φ = 15552000.
The previous prime is 32144759. The next prime is 32144797. The reversal of 32144768 is 86744123.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×321447682 = 2066572219547648, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 83 + ... + 8018.
It is an arithmetic number, because the mean of its divisors is an integer number (2066010).
Almost surely, 232144768 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 32144768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33056160).
32144768 is an abundant number, since it is smaller than the sum of its proper divisors (33967552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32144768 is an equidigital number, since it uses as much as digits as its factorization.
32144768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8146 (or 8134 counting only the distinct ones).
The product of its digits is 32256, while the sum is 35.
The square root of 32144768 is about 5669.6356143936. The cubic root of 32144768 is about 317.9582503897.
The spelling of 32144768 in words is "thirty-two million, one hundred forty-four thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •